How to squeeze a lexicon

DOI10.1002/SPE.402MaRDI QIDQ2783368zbMATH OpenOpenAlexFDO

Authors Marcin G. Ciura, Sebastian Deorowicz

Publication date 26 June 2002

Published in Software. Practice \& Experience (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/spe.402

zbMATH Keywords

acyclic deterministic finite automata

Mathematics Subject Classification ID

Data structures (68P05) Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Natural language processing (68T50) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 2081054
• scientific article; zbMATH DE number 2050933
• A fast and simple algorithm for constructing minimal acyclic deterministic finite automata
• A new algorithm for the construction of minimal acyclic DFAs.
• Incremental Construction and Maintenance of Minimal Finite-State Automata

Cites work

• Algorithms for trie compaction
• An algorithm for dynamic processing of dawg's
• Compressed tries
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 798342 (Why is no real title available?)
• Incremental Construction of Minimal Acyclic Finite-State Automata
• Minimisation of acyclic deterministic automata in linear time
• Perfect hashing

Cited in

(8)

• Optimal insertion in deterministic DAWGs
• Incremental construction of minimal tree automata
• A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
• Smaller representation of finite state automata
• scientific article; zbMATH DE number 2050933 (Why is no real title available?)
• scientific article; zbMATH DE number 2081054 (Why is no real title available?)
• Smaller representation of finite state automata
• Adaptive DFA based on array of sets

This page was built for publication: How to squeeze a lexicon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2783368)