Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Book cover Implementation and Application of Automata (CIAA 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9223))

Included in the following conference series:

  • 483 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. 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)

    Chapter  Google Scholar 

  2. Bassino, F., David, J., Nicaud, C.: Enumeration and random generation of possibly incomplete deterministic automata. Pure Math. Appl. 19, 1–16 (2009)

    MathSciNet  Google Scholar 

  3. Bassino, F., Nicaud, C.: Enumeration and random generation of accessible automata. Theor. Comput. Sci. 381(1–3), 86–104 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. 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)

    Chapter  Google Scholar 

  5. 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)

    Google Scholar 

  6. Champarnaud, J.-M., Paranthoën, T.: Random generation of dfas. Theor. Comput. Sci. 330(2), 221–235 (2005)

    Article  MATH  Google Scholar 

  7. 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)

    Article  MathSciNet  MATH  Google Scholar 

  8. Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2008)

    Google Scholar 

  9. 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)

    Google Scholar 

  10. 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)

    Article  MATH  Google Scholar 

  11. Héam, P.-C., Nicaud, C., Schmitz, S.: Parametric random generation of deterministic tree automata. Theor. Comput. Sci. 411(38–39), 3469–3480 (2010)

    Article  MATH  Google Scholar 

  12. Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  13. Korshunov, D.: Enumeration of finite automata. Problemy Kibernetiki 34, 5–82 (1978)

    MathSciNet  MATH  Google Scholar 

  14. Korshunov, A.D.: On the number of non-isomorphic strongly connected finite automata. Elektronische Informationsverarbeitung und Kybernetik 22(9), 459–462 (1986)

    MathSciNet  MATH  Google Scholar 

  15. Liskovets, V.A.: Exact enumeration of acyclic deterministic automata. Discret. Appl. Math. 154(3), 537–551 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  16. Nicaud, C.: Etude du comportement en moyenne des automate finis et des langages rationnels. Ph.D. thesis, Université Paris VII (2000)

    Google Scholar 

  17. 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)

    Google Scholar 

  18. 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)

    Google Scholar 

  19. Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)

    Book  MATH  Google Scholar 

  20. Vyssotsky, V.: A counting problem for finite automata. Technical report, Bell Telephon Laboratories (1959)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FEMTO-ST, CNRS UMR 6174, Université de Franche-Comté, INRIA, 16 Route de Gray, 25030, Besançon Cedex, France

    Pierre-Cyrille Héam & Jean-Luc Joly

Authors
  1. Pierre-Cyrille Héam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Luc Joly
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pierre-Cyrille Héam .

Editor information

Editors and Affiliations

  1. Umeå University, Umeå, Sweden

    Frank Drewes

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation