Nondeterministic Moore Automata and Brzozowski’s Algorithm

DOI10.1007/978-3-642-22256-6_9zbMath1297.68113OpenAlexW183058569MaRDI QIDQ5200055

Marinella Sciortino, Giuseppa Castiglione, Antonio Restivo

Publication date: 29 July 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-22256-6_9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Algebra-coalgebra duality in brzozowski's minimization algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal simulation of self-verifying automata by deterministic automata
• Circular Sturmian words and Hopcroft's algorithm
• Minimization algorithms for sequential transducers
• On extremal cases of Hopcroft's algorithm
• A Challenging Family of Automata for Classical Minimization Algorithms
• Experimental Evaluation of Classical Automata Constructions
• On the State Minimization of Nondeterministic Finite Automata

This page was built for publication: Nondeterministic Moore Automata and Brzozowski’s Algorithm