DFA minimization: double reversal versus split minimization algorithms

DOI10.1016/J.TCS.2015.04.002zbMath1385.68020DBLPjournals/tcs/GarciaLP15OpenAlexW2076634344WikidataQ58209327 ScholiaQ58209327MaRDI QIDQ2342683

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

Publication date: 29 April 2015

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

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

zbMATH Keywords

DFA minimizationatomic automatondouble reversal algorithmssplit minimization algorithms

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Coalgebraic minimization of automata by initiality and finality

Cites Work

• A polynomial double reversal minimization algorithm for deterministic finite automata
• Theory of átomata
• Unnamed Item
• Unnamed Item

This page was built for publication: DFA minimization: double reversal versus split minimization algorithms