Paper Info
Title
On the Representation of Finite Automata
Abstract
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 k, and how its enumeration provides an alternative way to obtain the exact number of ICDFA's.
Year
Venue
Keywords
2005
Computing Research Repository
finite automata,deterministic finite automata,formal language,automata theory
DocType
Volume
Citations 
Conference
abs/0906.2
6
PageRank 
References 
Authors
0.69
6
3
Name
Order
Citations
PageRank
Rogério Reis114025.74
Nelma Moreira218033.98
Marco Almeida3313.99