Skip to main content
SpringerLink
Log in

Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs

  • Conference paper
  • First Online:
Descriptional Complexity of Formal Systems (DCFS 2018)

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

Included in the following conference series:

Abstract

We define the class of forward injective finite automata (FIFA) and study some of their properties. Each FIFA has a unique canonical representation up to isomorphism. Using this representation an enumeration is given and an efficient uniform random generator is presented. We provide a conversion algorithm from a nondeterministic finite automaton or regular expression into an equivalent FIFA. Finally, we present some experimental results comparing the size of FIFA with other automata.

Authors partially funded by CMUP (UID/MAT/00144/2013), which is funded by FCT (Portugal) with national (MCTES) and European structural funds through the programs FEDER, under the partnership agreement PT2020.

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. Almeida, M., Moreira, N., Reis, R.: Enumeration and generation with a string automata representation. Theor. Comput. Sci. 387(2), 93–102 (2007)

    Article  MathSciNet  Google Scholar 

  2. Antimirov, V.M.: Partial derivatives of regular expressions and finite automaton constructions. Theor. Comput. Sci. 155(2), 291–319 (1996)

    Article  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  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  5. FAdo, P.: FAdo: tools for formal languages manipulation. http://fado.dcc.up.pt. Accessed 13 2018

  6. Héam, P.-C., Joly, J.-L.: On the uniform random generation of non deterministic automata up to isomorphism. In: Drewes, F. (ed.) CIAA 2015. LNCS, vol. 9223, pp. 140–152. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-22360-5_12

    Chapter  MATH  Google Scholar 

  7. Knuth, D.E.: The Art of Computer Programming. Seminumerical Algorithms, vol. 2, 2nd edn. Addison Wesley, Boston (1981)

    Google Scholar 

  8. Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chain and Mixing Times. American Mathematical Society (2008). http://pages.uoregon.edu/dlevin/MARKOV/markovmixing.pdf

  9. Lothaire, M.: Applied Combinatorics on Words, vol. 105. Encyclopedia of Mathematics and its Applications. Cambridge University Press, New York (2005)

    Google Scholar 

  10. 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). https://doi.org/10.1007/978-3-662-44522-8_2

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CMUP and DCC, Faculdade de Ciências da Universidade do Porto, Rua do Campo Alegre, 1021, 4169-007, Porto, Portugal

    Miguel Ferreira, Nelma Moreira & Rogério Reis

Authors
  1. Miguel Ferreira
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nelma Moreira
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rogério Reis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nelma Moreira .

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computing Science, Saint Mary’s University, Halifax, Nova Scotia, Canada

    Stavros Konstantinidis

  2. Dipartimento di Informatica e Comunicazi, Universita degli Studi di Milano, Milan, Italy

    Giovanni Pighizzini

Rights and permissions

Reprints and permissions

Copyright information

© 2018 IFIP International Federation for Information Processing

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ferreira, M., Moreira, N., Reis, R. (2018). Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs. In: Konstantinidis, S., Pighizzini, G. (eds) Descriptional Complexity of Formal Systems. DCFS 2018. Lecture Notes in Computer Science(), vol 10952. Springer, Cham. https://doi.org/10.1007/978-3-319-94631-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-94631-3_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-94630-6

  • Online ISBN: 978-3-319-94631-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation