On the Size of the Universal Automaton of a Regular Language

DOI10.1007/978-3-540-70918-3_8MaRDI QIDQ3590923zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The universal automaton
• Unambiguous finite automata over a unary alphabet
• MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON
• Implementation and Application of Automata
• Unambiguous finite automata over a unary alphabet

Cited in

(7)

• scientific article; zbMATH DE number 7075888 (Why is no real title available?)
• MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON
• On the size of Boyer-Moore automata
• On the existence of universal finite or pushdown automata
• NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs
• The universal automaton
• Implementation and Application of Automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590923)