An approximation algorithm for state minimization in 2-MDFAs

DOI10.1007/s00165-006-0005-4zbMath1105.68067OpenAlexW2093102658MaRDI QIDQ855011

C. Tauras, K. Subramani and Vahan Mkrtchyan

Publication date: 20 December 2006

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-006-0005-4

zbMATH Keywords

2-MDFAFinite state automataState minimization

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Minimizing finite automata is computationally hard
• Succinct representation of regular languages by Boolean automata
• The state complexities of some basic operations on regular languages
• Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
• On Approximate Solutions for Combinatorial Optimization Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An approximation algorithm for state minimization in 2-MDFAs