A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs
[chapter]
2018
Lecture Notes in Computer Science
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 e cient 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
doi:10.1007/978-3-319-94631-3_8
fatcat:wkwq4c2rmfc35hqwsqr26f4pta