On the Size of the Universal Automaton of a Regular Language

DOI10.1007/978-3-540-70918-3_8zbMath1186.68263OpenAlexW1497816857MaRDI QIDQ3590923

Sylvain Lombardy

Publication date: 3 September 2007

Published in: STACS 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_8

zbMATH Keywords

regular languagesuniversal automatonNFA minimization

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

This page was built for publication: On the Size of the Universal Automaton of a Regular Language