Name
Abstract | ||
|---|---|---|
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 backtracking algorithm for the exact generation of ADFAs. This algorithm is a non trivial adaptation of the algorithm for the exact generation of minimal acyclic deterministic finite automata (MADFA), presented by Almeida et al.. |
Year | Venue | Keywords |
|---|---|---|
2008 | Clinical Orthopaedics and Related Research | canonical representation,automata theory,normal form,deterministic finite automata,formal language |
DocType | Volume | Citations |
Conference | abs/0908.3315 | 1 |
PageRank | References | Authors |
0.38 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marco Almeida | 1 | 31 | 3.99 |
| Nelma Moreira | 2 | 180 | 33.98 |
| Rogério Reis | 3 | 140 | 25.74 |