Nondeterministic Moore automata and Brzozowski's minimization algorithm

DOI10.1016/j.tcs.2012.04.029zbMath1280.68116OpenAlexW2007783859MaRDI QIDQ442154

Antonio Restivo, Marinella Sciortino, Giuseppa Castiglione

Publication date: 9 August 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.029

zbMATH Keywords

automata minimizationBrzozowski's minimization algorithmnondeterministic Moore automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Uses Software

• fsm2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal simulation of self-verifying automata by deterministic automata
• Minimization algorithms for sequential transducers
• On extremal cases of Hopcroft's algorithm
• Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
• Hopcroft's algorithm and tree-like automata
• A Challenging Family of Automata for Classical Minimization Algorithms
• Weighted Automata Algorithms
• Experimental Evaluation of Classical Automata Constructions
• Lattice Automata
• On the State Minimization of Nondeterministic Finite Automata
• Minimizing Deterministic Lattice Automata

This page was built for publication: Nondeterministic Moore automata and Brzozowski's minimization algorithm