An approximation algorithm for state minimization in 2-MDFAs

DOI10.1007/S00165-006-0005-4zbMATH Open1105.68067OpenAlexW2093102658WikidataQ130975063 ScholiaQ130975063MaRDI QIDQ855011FDOQ855011

K. Subramani, C. Tauras

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

Recommendations

• STACS 2005
• Minimizing nfa's and regular expressions
• Minimizing finite automata is computationally hard
• scientific article; zbMATH DE number 1309169
• On minimising automata with errors

zbMATH Keywords

2-MDFAFinite state automataState minimization

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• The state complexities of some basic operations on regular languages
• Title not available (Why is that?)
• On Approximate Solutions for Combinatorial Optimization Problems
• Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
• Title not available (Why is that?)
• Minimizing finite automata is computationally hard
• Succinct representation of regular languages by Boolean automata

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

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