7 citations · 10 across the 4 of their papers we have counts for
4 papers
Exact generation of acyclic deterministic finite automata
Marco Almeida, Nelma Moreira, Rogério Reis
We give a canonical representation for trim acyclic deterministic finite automata (Adfa) with n states over an alphabet of k symbols. Using this normal form, we present a backtrack…
Testing the Equivalence of Regular Languages
Marco Almeida, Nelma Moreira, Rogério Reis
The minimal deterministic finite automaton is generally used to determine regular languages equality. Antimirov and Mosses proposed a rewrite system for deciding regular expression…
Aspects of enumeration and generation with a string automata representation
Marco Almeida, Nelma Moreira, Rogério Reis
In general, the representation of combinatorial objects is decisive for the feasibility of several enumerative tasks. In this work, we show how a (unique) string representation for…
On the Representation of Finite Automata
Rogério Reis, Nelma Moreira, Marco Almeida
We give an unique string representation, up to isomorphism, for initially connected deterministic finite automata (ICDFAs) with n states over an alphabet of k symbols. We show how…