The minimalization of tree automata
From MaRDI portal
Publication:5570935
Cited in
(19)- Mappings and grammars on trees
- Another variation on the common subexpression problem
- Inference of tree automata from sample set of trees
- A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
- From tree automata to string automata minimization
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Automata on infinite objects and their applications to logic and programming
- Generalized sequential machine maps
- Learning context-free grammars from structural data in polynomial time
- Incremental construction of minimal tree automata
- Artwork based on automatic sequences
- A congruence-based perspective on finite tree automata
- The congruence theory of closure properties of regular tree languages
- Fixed-point constructions in order-enriched categories
- Cascades of tree-automata and computations in universal algebras
- Deciding top-down determinism of regular tree languages
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
- An Implementation of Deterministic Tree Automata Minimization
- First-order logic definability of free languages
This page was built for publication: The minimalization of tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5570935)
