Random Deterministic Automata

In this article, we consider deterministic automata under the paradigm of average case analysis of algorithms. We present the main results obtained in the literature using this point of view, from the very beginning with Korshunov’s theorem about the asymptotic number of accessible automata to the most recent advances, such as the average running time of Moore’s state minimization algorithm or the estimation of the probability that an automaton is minimal. While focusing on results, we also try to give an idea of the main tools used in this field.

[1]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

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

[3]  Valentine Kabanets,et al.  Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits , 2015, COCOON.

[4]  J. Brzozowski.  Canonical regular expressions and minimal state graphs for definite events , 1962 .

[5]  Daniel Berend,et al.  The state complexity of random DFAs , 2013, Theor. Comput. Sci..

[6]  Josef Kittler,et al.  Combinatorial Algorithms , 2016, Lecture Notes in Computer Science.

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

[8]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[9]  Mikhail V. Berlinkov.  On the probability to be synchronizable , 2013, ArXiv.

[10]  Grzegorz Rozenberg,et al.  Developments in Language Theory II , 2002 .

[11]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[12]  J. M. Foster,et al.  Mathematical theory of automata , 1965 .

[13]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[14]  Julien David,et al.  Average complexity of Moore's and Hopcroft's algorithms , 2012, Theor. Comput. Sci..

[15]  T. C. Hu,et al.  Combinatorial algorithms , 1982 .

[16]  P. Flajolet,et al.  Analytic Combinatorics: RANDOM STRUCTURES , 2009 .

[17]  Richard M. Karp,et al.  The Transitive Closure of a Random Digraph , 1990, Random Struct. Algorithms.

[18]  Ahmed Khorsi,et al.  Split and join for minimizing: Brzozowski's algorithm , 2002, Stringology.

[19]  André Almeida,et al.  FAdo and GUItar , 2009, CIAA.

[20]  V. Liskovets.  The number of connected initial automata , 1969 .

[21]  Elcio Lebensztayn,et al.  On the asymptotic enumeration of accessible automata , 2010, Discret. Math. Theor. Comput. Sci..

[22]  Frédérique Bassino,et al.  : A Library to Randomly and Exhaustively Generate Automata , 2007, CIAA.

[23]  Moshe Y. Vardi,et al.  Experimental Evaluation of Classical Automata Constructions , 2005, LPAR.

[24]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[25]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[26]  Edward F. Moore,et al.  Gedanken-Experiments on Sequential Machines , 1956 .

[27]  Arnaud Carayol,et al.  Distribution of the number of accessible states in a random deterministic automaton , 2012, STACS.

[28]  Jean-Jacques Quisquater,et al.  Advances in Cryptology — EUROCRYPT ’89 , 1991, Lecture Notes in Computer Science.

[29]  Jakub Kowalski,et al.  28 22 v 1 [ cs . F L ] 1 3 M ar 2 01 2 Fast algorithm finding the shortest reset words , 2012 .

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

[31]  Philippe Flajolet,et al.  Analytic Combinatorics , 2009 .

[32]  Alain Denise,et al.  Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic , 1999, Theor. Comput. Sci..

[33]  Cyril Nicaud,et al.  On the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final States , 2014, Developments in Language Theory.

[34]  Frédérique Bassino,et al.  On the Average Complexity of Moore's State Minimization Algorithm , 2009, STACS.

[35]  Borivoj Melichar,et al.  Finding Common Motifs with Gaps Using Finite Automata , 2006, CIAA.

[36]  Jacques Sakarovitch,et al.  Introducing VAUCANSON , 2004, Theor. Comput. Sci..

[37]  Cyril Nicaud,et al.  Average Case Analysis of Moore’s State Minimization Algorithm , 2011, Algorithmica.

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

[39]  Guy Louchard,et al.  Boltzmann Samplers for the Random Generation of Combinatorial Structures , 2004, Combinatorics, Probability and Computing.

[40]  Cyril Nicaud,et al.  Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata , 2013, Developments in Language Theory.

[41]  Philippe Flajolet,et al.  Random Mapping Statistics , 1990, EUROCRYPT.

[42]  Leszek Pacholski,et al.  Mathematical Foundations of Computer Science 1999 , 1999, Lecture Notes in Computer Science.

[43]  Cyril Nicaud,et al.  Average State Complexity of Operations on Unary Automata , 1999, MFCS.

[44]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[45]  Frank Harary,et al.  Enumeration of Finite Automata , 1967, Inf. Control..

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

[47]  Frédérique Bassino,et al.  Linear-time generation of specifiable combinatorial structures: general theory and first examples , 2013, ArXiv.

[48]  Nelma Moreira,et al.  Enumeration and generation with a string automata representation , 2007, Theor. Comput. Sci..

[49]  Cyril Nicaud,et al.  Fast Synchronization of Random Automata , 2014, APPROX-RANDOM.

[50]  Philippe Flajolet,et al.  A Calculus for the Random Generation of Labelled Combinatorial Structures , 1994, Theor. Comput. Sci..

[51]  Michael A. Harrison.  A census finite automata , 1964 .

[52]  Cyril Nicaud,et al.  Etude du comportement en moyenne des automates finis et des langages rationnels , 2000 .

[53]  Wojciech Rytter,et al.  Text Algorithms , 1994 .

[54]  I. Good.  An Asymptotic Formula for the Differences of the Powers at Zero , 1961 .