scientific article; zbMATH DE number 2081054

zbMATH Open1050.68592MaRDI QIDQ4474161FDOQ4474161

Authors: B. W. Watson 

Publication date: 4 August 2004

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

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (11)

• EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA
• Title not available (Why is that?)
• Direct construction of minimal acyclic finite states automata
• A graph theoretic approach to automata minimality
• Title not available (Why is that?)
• Incremental Construction of Minimal Acyclic Finite-State Automata
• A fast and simple algorithm for constructing minimal acyclic deterministic finite automata
• A new algorithm for the construction of minimal acyclic DFAs.
• Construction of minimal deterministic finite automata from biological motifs
• Adaptive DFA based on array of sets
• How to squeeze a lexicon

This page was built for publication:

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