Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata

This paper presents a general framework for the uniform random generation of deterministic real-time accessible pushdown automata. A polynomial time algorithm to randomly generate a pushdown automaton having a fixed stack operations total size is proposed. The influence of the accepting condition (empty stack, final state) on the reachability of the generated automata is investigated.

[1]  Frédérique Bassino,et al.  Enumeration and random generation of possibly incomplete deterministic automata. , 2008 .

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

[3]  Cyril Nicaud,et al.  Random Deterministic Automata , 2014, MFCS.

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

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

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

[7]  Valery A. Liskovets,et al.  Exact enumeration of acyclic deterministic automata , 2006, Discret. Appl. Math..

[8]  Aleksej D. Korshunov.  On the Number of Non-isomorphic Strongly Connected Finite Automata , 1986, J. Inf. Process. Cybern..

[9]  Robert W. Robinson.  Counting strongly connected finite automata , 1985 .

[10]  Pierre Wolper,et al.  A direct symbolic approach to model checking pushdown systems , 1997, INFINITY.

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

[12]  Jacques Sakarovitch,et al.  Elements of Automata Theory , 2009 .

[13]  Pierre-Cyrille Héam,et al.  Parametric random generation of deterministic tree automata , 2010, Theor. Comput. Sci..

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

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

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

[17]  Vincent Carnino,et al.  Random Generation of Deterministic Acyclic Automata Using Markov Chains , 2011, CIAA.

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

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