A taxonomy of algorithms for constructing minimal acyclic deterministic finite automata

DOI10.1007/3-540-45526-4_16MaRDI QIDQ4474161zbMATH OpenFDO

Authors B. W. Watson

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2214/22140174.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• A fast and simple algorithm for constructing minimal acyclic deterministic finite automata
• Direct construction of minimal acyclic finite states automata
• A new algorithm for the construction of minimal acyclic DFAs.
• scientific article; zbMATH DE number 2050934
• How to squeeze a lexicon

Cited in

(11)

• A new algorithm for the construction of minimal acyclic DFAs.
• How to squeeze a lexicon
• Direct construction of minimal acyclic finite states automata
• EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA
• A graph theoretic approach to automata minimality
• Incremental Construction of Minimal Acyclic Finite-State Automata
• An O(n^2) algorithm for constructing minimal cover automata for finite languages
• scientific article; zbMATH DE number 798342 (Why is no real title available?)
• A fast and simple algorithm for constructing minimal acyclic deterministic finite automata
• Adaptive DFA based on array of sets
• Construction of minimal deterministic finite automata from biological motifs

This page was built for publication: A taxonomy of algorithms for constructing minimal acyclic deterministic finite automata

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