Incremental construction of minimal tree automata
From MaRDI portal
Publication:2391189
Recommendations
- An Implementation of Deterministic Tree Automata Minimization
- Incremental Construction and Maintenance of Minimal Finite-State Automata
- From tree automata to string automata minimization
- Comments on ``Incremental construction and maintenance of minimal finite-state automata
- A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
Cites work
- scientific article; zbMATH DE number 3854429 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1949646 (Why is no real title available?)
- An Implementation of Deterministic Tree Automata Minimization
- Comments on ``Incremental construction and maintenance of minimal finite-state automata
- How to squeeze a lexicon
- Incremental Construction and Maintenance of Minimal Finite-State Automata
- Incremental Construction of Minimal Acyclic Finite-State Automata
- Optimization of LR(k) parsers
- The minimalization of tree automata
Cited in
(6)- Minimal Ascending and Descending Tree Automata
- An Implementation of Deterministic Tree Automata Minimization
- An incremental unique representation for regular trees
- A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
- Incremental Construction of Minimal Acyclic Finite-State Automata
- From tree automata to string automata minimization
This page was built for publication: Incremental construction of minimal tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391189)
