The state complexity of random DFAs

The state complexity of a Deterministic Finite-state automaton (DFA) is the number of states in its minimal equivalent DFA. We study the state complexity of random $n$-state DFAs over a $k$-symbol alphabet, drawn uniformly from the set $[n]^{[n]\times[k]}\times2^{[n]}$ of all such automata. We show that, with high probability, the latter is $\alpha_k n + O(\sqrt n\log n)$ for a certain explicit constant $\alpha_k$.

[1]  Frédérique Bassino,et al.  Asymptotic enumeration of Minimal Automata , 2011, STACS.

[2]  Boris Pittel,et al.  On Distributions Related to Transitive Closures of Random Finite Mappings , 1983 .

[3]  Jean-Marc Champarnaud,et al.  Random generation of DFAs , 2005, Theor. Comput. Sci..

[4]  Robert M. Corless,et al.  A sequence of series for the Lambert W function , 1997, ISSAC.

[5]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[6]  Jeffrey Shallit,et al.  On the Number of Distinct Languages Accepted by Finite Automata with n States , 2002, DCFS.

[7]  Aryeh Kontorovich,et al.  Universal Kernel-Based Learning with Applications to Regular Languages , 2009, J. Mach. Learn. Res..

[8]  John E. Hopcroft,et al.  An n log n algorithm for minimizing states in a finite automaton , 1971 .

[9]  Leonidas J. Guibas,et al.  Fourier Theoretic Probabilistic Inference over Permutations , 2009, J. Mach. Learn. Res..

[10]  Desh Ranjan,et al.  Balls and bins: A study in negative dependence , 1996, Random Struct. Algorithms.

[11]  Borja Balle,et al.  Ergodicity of Random Walks on Random DFA , 2013, ArXiv.

[12]  Grzegorz Rozenberg,et al.  Handbook of formal languages, vol. 1: word, language, grammar , 1997 .

[13]  Boris A. Trakhtenbrot,et al.  Finite automata : behavior and synthesis , 1973 .

[14]  David Eisenstat,et al.  Lower Bounds on Learning Random Structures with Statistical Queries , 2010, ALT.

[15]  B. Pittel.  On spreading a rumor , 1987 .

[16]  A. A. Grusho.  Limit distributions of certain characteristics of random automaton graphs , 1973 .

[17]  Frédérique Bassino,et al.  Enumeration and random generation of accessible automata , 2007, Theor. Comput. Sci..