Incremental construction of minimal tree automata
From MaRDI portal
Publication:2391189
DOI10.1007/S00453-008-9172-4zbMATH Open1180.68168OpenAlexW1969183341MaRDI QIDQ2391189FDOQ2391189
Rafael C. Carrasco, Mikel L. Forcada, Jan Daciuk
Publication date: 24 July 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9172-4
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
- Title not available (Why is that?)
- Optimization of LR(k) parsers
- Title not available (Why is that?)
- Incremental Construction of Minimal Acyclic Finite-State Automata
- How to squeeze a lexicon
- The minimalization of tree automata
- An Implementation of Deterministic Tree Automata Minimization
- Incremental Construction and Maintenance of Minimal Finite-State Automata
- Comments on “Incremental Construction and Maintenance of Minimal Finite-State Automata,” by Rafael C. Carrasco and Mikel L. Forcada
- Title not available (Why is that?)
Cited In (6)
- 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
- An incremental unique representation for regular trees
- An Implementation of Deterministic Tree Automata Minimization
- Minimal Ascending and Descending Tree Automata
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)
