On the Size of the Universal Automaton of a Regular Language

DOI10.1007/978-3-540-70918-3_8zbMATH Open1186.68263OpenAlexW1497816857MaRDI QIDQ3590923FDOQ3590923

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

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

zbMATH Keywords

regular languagesuniversal automatonNFA minimization

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (7)

• Title not available (Why is that?)
• MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON
• On the existence of universal finite or pushdown automata
• NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs
• On the size of Boyer-Moore automata
• 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)