Weak Minimization of DFA — An Algorithm and Applications

DOI10.1007/3-540-45089-0_21MaRDI QIDQ3559776zbMATH OpenOpenAlexFDO

Authors B. Ravikumar

Publication date 7 May 2010

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45089-0_21

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Weak minimization of DFA -- an algorithm and applications
• Efficient minimization of deterministic weak -automata
• Description and analysis of a bottom-up DFA minimization algorithm
• Efficient algorithms for the inference of minimum size DFAs
• On the Hopcroft's minimization technique for DFA and DFCA
• Efficient minimization of DFAs with partial transition
• scientific article; zbMATH DE number 1955813
• Congruence and minimization of deterministic weighted finite automata
• Fast brief practical DFA minimization
• DFA minimization: double reversal versus split minimization algorithms

Cited in

(3)

• Some New Features and Algorithms for the Study of DFA
• Efficient algorithms for the inference of minimum size DFAs
• Weak minimization of DFA -- an algorithm and applications

This page was built for publication: Weak Minimization of DFA — An Algorithm and Applications

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