On the Representation of Finite Automata

Details On the Representation of Finite Automata On the Representation of Finite Automata

2009-06-13

arxiv.org/abs/0906.2477v1

Computer Science

Formal Languages and Automata Theory

DCFS 2005

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the Representation of Finite Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Representation of Finite Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Representation of Finite Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-252518