Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs
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.
- 5.FAdo, P.: FAdo: tools for formal languages manipulation. http://fado.dcc.up.pt. Accessed 13 2018
- 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