Closure properties of hyper-minimized automata

DOI10.1051/ita/2011128zbMath1232.68087OpenAlexW1979256183MaRDI QIDQ3117549

Andrzej Szepietowski

Publication date: 28 February 2012

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2011__45_4_459_0/

zbMATH Keywords

regular languagesfinite state automatahyper-minimized automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Cites Work

• An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton
• Hyper-minimizing minimized deterministic finite state automata
• Unnamed Item

This page was built for publication: Closure properties of hyper-minimized automata