On the size of the universal automaton of a regular language

Authors:
Sylvain Lombardy
Affiliations:
Université de Marne-la-Valle, Institut Gaspard-Monge, UMR CNRS, Marne-la-Valle Cedex 2
Venue:
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Year:
2007

Citing 8
Cited 0

Minimal NFA problems are hard

SIAM Journal on Computing
On the Construction of Reversible Automata for Reversible Languages

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Star Height of Reversible Languages and Universal Automata

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Errata to: "finite automata and unary languages"

Theoretical Computer Science
Reducing NFAs by invariant equivalences

Theoretical Computer Science
NFA reduction algorithms by means of regular inequalities

Theoretical Computer Science - Developments in language theory
Mergible states in large NFA

Theoretical Computer Science - Insightful theory
On a maximal NFA without mergible states

CSR'06 Proceedings of the First international computer science conference on Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The universal automaton of a regular language is the maximal NFA without merging states that recognizes this language. This automaton is directly inspired by the factor matrix defined by Conway thirty years ago.We prove in this paper that a tight bound on its size with respect to the size of the smallest equivalent NFA is given by Dedekind's numbers. At the end of the paper, we deal with the unary case. Chrobak has proved that the size of the minimal deterministic automaton with respect to the smallest NFA is tightly bounded by the Landau's function; we show that the size of the universal automaton is in this case an exponential of the Landau's function.