Incremental construction of minimal tree automata
From MaRDI portal
Publication:2391189
DOI10.1007/s00453-008-9172-4zbMath1180.68168OpenAlexW1969183341MaRDI QIDQ2391189
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
Related Items
An Implementation of Deterministic Tree Automata Minimization ⋮ From tree automata to string automata minimization ⋮ A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization of LR(k) parsers
- How to squeeze a lexicon
- Comments on “Incremental Construction and Maintenance of Minimal Finite-State Automata,” by Rafael C. Carrasco and Mikel L. Forcada
- An Implementation of Deterministic Tree Automata Minimization
- Incremental Construction and Maintenance of Minimal Finite-State Automata
- Incremental Construction of Minimal Acyclic Finite-State Automata
- The minimalization of tree automata