Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bassino, F., David, J., Nicaud, C.: REGAL: a library to randomly and exhaustively generate automata. In: Holub, J., Žd’árek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 303–305. Springer, Heidelberg (2007)
Bassino, F., David, J., Nicaud, C.: Enumeration and random generation of possibly incomplete deterministic automata. Pure Math. Appl. 19, 1–16 (2009)
Bassino, F., Nicaud, C.: Enumeration and random generation of accessible automata. Theor. Comput. Sci. 381(1–3), 86–104 (2007)
Carnino, V., De Felice, S.: Random generation of deterministic acyclic automata using Markov chains. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol. 6807, pp. 65–75. Springer, Heidelberg (2011)
Carayol, A., Nicaud, C.: Distribution of the number of accessible states in a random deterministic automaton. In: STACS 2012, LIPIcs, vol. 14, pp. 194–205 (2012)
Champarnaud, J.-M., Paranthoën, T.: Random generation of dfas. Theor. Comput. Sci. 330(2), 221–235 (2005)
Duchon, P., Flajolet, P., Louchard, G., Schaeffer, G.: Boltzmann samplers for the random generation of combinatorial structures. Comb. Probab. Comput. 13(4–5), 577–625 (2004)
Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2008)
Finkel, A., Willems, B., Wolper, P.: A direct symbolic approach to model checking pushdown systems (extended abstract). In: INFINITY 1997, Electronic Notes in Theoretical Computer Science, vol. 9 pp. 27–39 (1997)
Flajolet, P., Zimmermann, P., Van Cutsem, B.: A calculus for the random generation of labelled combinatorial structures. Theor. Comput. Sci. 132(2), 1–35 (1994)
Héam, P.-C., Nicaud, C., Schmitz, S.: Parametric random generation of deterministic tree automata. Theor. Comput. Sci. 411(38–39), 3469–3480 (2010)
Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
Korshunov, D.: Enumeration of finite automata. Problemy Kibernetiki 34, 5–82 (1978)
Korshunov, A.D.: On the number of non-isomorphic strongly connected finite automata. Elektronische Informationsverarbeitung und Kybernetik 22(9), 459–462 (1986)
Liskovets, V.A.: Exact enumeration of acyclic deterministic automata. Discret. Appl. Math. 154(3), 537–551 (2006)
Nicaud, C.: Etude du comportement en moyenne des automate finis et des langages rationnels. Ph.D. thesis, Université Paris VII (2000)
Nicaud, C.: Random deterministic automata. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds.) MFCS 2014, Part I. LNCS, vol. 8634, pp. 5–23. Springer, Heidelberg (2014)
Robinson, R.: Counting strongly connected finite automata. In: Alavi, Y. (ed.) Graph Theory with Applications to Algorithms and Computer Science, pp. 671–685. Wiley, New York (1985)
Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)
Vyssotsky, V.: A counting problem for finite automata. Technical report, Bell Telephon Laboratories (1959)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Héam, PC., Joly, JL. (2015). Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata. In: Drewes, F. (eds) Implementation and Application of Automata. CIAA 2015. Lecture Notes in Computer Science(), vol 9223. Springer, Cham. https://doi.org/10.1007/978-3-319-22360-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-22360-5_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-22359-9
Online ISBN: 978-3-319-22360-5
eBook Packages: Computer ScienceComputer Science (R0)