Abstract (EN):
We give an unique string representation, up to isomorphism, for initially connected deterministic finite automata (ICDFA's) with n states over an alphabet of k symbols. We show how to generate all these strings for each n and ft, and how its enumeration provides an alternative way to obtain the exact number of ICDFA's.
Idioma:
Inglês
Tipo (Avaliação Docente):
Científica
Nº de páginas:
8