Exact generation of acyclic deterministic finite automata

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2008

Autores

Almeida, M (Autor) Outra; Moreira, N (Autor) FCUP; Reis, R (Autor) FCUP

Ata de Conferência Internacional

Título: Descriptional Complexity of Formal Systems - 10th International Workshop, DCFS 2008

Páginas: 48-60

10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008

Charlottetown, PE, 16 July 2008 through 18 July 2008

Indexação

ISI Web of Knowledge

Scopus - 1 Citação

Outras Informações

ID Authenticus: P-009-5AB

Abstract (EN): 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.

Idioma: Inglês

Tipo (Avaliação Docente): Científica