A polynomial double reversal minimization algorithm for deterministic finite automata

DOI10.1016/j.tcs.2013.03.005zbMath1293.68190OpenAlexW2147441235WikidataQ58209334 ScholiaQ58209334MaRDI QIDQ386994

Damián López, Manuel Vázquez de Parga, Pedro García

Publication date: 11 December 2013

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

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

zbMATH Keywords

atomic automataDFA minimizationpolynomial double reversal algorithm

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

EFFICIENT DETERMINISTIC FINITE AUTOMATA SPLIT-MINIMIZATION DERIVED FROM BRZOZOWSKI'S ALGORITHM ⋮ Theory of átomata ⋮ Standard Sturmian words and automata minimization algorithms ⋮ A congruence-based perspective on automata minimization algorithms ⋮ DFA minimization: double reversal versus split minimization algorithms

Uses Software

• RFSA

Cites Work

• Unnamed Item
• Unnamed Item
• Learning regular languages using RFSAs.
• Theory of Átomata
• MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON

This page was built for publication: A polynomial double reversal minimization algorithm for deterministic finite automata