DMCA
Departamento de Ciência de Computadores Laboratório de Inteligência Artificial e Ciência de Computadores
Cached
Download Links
by
Marco Almeida
,
Nelma Moreira
,
Rogério Reis
,
Rua Do Campo Alegre
BibTeX
@MISC{Almeida_departamentode,
author = {Marco Almeida and Nelma Moreira and Rogério Reis and Rua Do Campo Alegre},
title = {Departamento de Ciência de Computadores Laboratório de Inteligência Artificial e Ciência de Computadores},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We give a canonical representation for minimal acyclic deterministic finite automata (MADFA) with n states over an alphabet of k symbols. Using this normal form, we present a method for the exact generation of MADFAs. This method avoids a rejection phase, that would be needed if a generation algorithm for a larger class of objects that contains the MADFAs were used. We give an upper bound for MADFAs enumeration that is exact for small values of n. 1
