On the Representation of Finite Automata
Formal Languages and Automata Theory
2009-06-16 v1
Abstract
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 to generate all these strings for each n and k, and how its enumeration provides an alternative way to obtain the exact number of ICDFAs.
Keywords
Cite
@article{arxiv.0906.2477,
title = {On the Representation of Finite Automata},
author = {Rogério Reis and Nelma Moreira and Marco Almeida},
journal= {arXiv preprint arXiv:0906.2477},
year = {2009}
}
Comments
DCFS 2005