Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs - Descriptional Complexity of Formal Systems Access content directly
Conference Papers Year : 2018

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

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.
Fichier principal
Vignette du fichier
470153_1_En_8_Chapter.pdf (342.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01905623 , version 1 (26-10-2018)

Licence

Attribution

Identifiers

Cite

Miguel Ferreira, Nelma Moreira, Rogério Reis. Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs. 20th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2018, Halifax, NS, Canada. pp.88-100, ⟨10.1007/978-3-319-94631-3_8⟩. ⟨hal-01905623⟩
45 View
74 Download

Altmetric

Share

Gmail Facebook X LinkedIn More