On the Representation of Finite Automata
classification
💻 cs.FL
keywords
automatafiniteicdfasrepresentationalphabetalternativeconnecteddeterministic
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.