A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
From MaRDI portal
Publication:3653096
DOI10.1051/ita/2009018zbMath1183.68334OpenAlexW2158388671MaRDI QIDQ3653096
Rafael C. Carrasco, Jan Daciuk
Publication date: 18 December 2009
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92937
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Pseudo-minimal transducer
- Incremental construction of minimal tree automata
- Organization and maintenance of large ordered indexes
- 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
- Minimal Ascending and Descending Tree Automata
- Incremental Construction and Maintenance of Minimal Finite-State Automata
- Incremental Construction of Minimal Acyclic Finite-State Automata
- The minimalization of tree automata
- Implementation and Application of Automata