Exact generation of acyclic deterministic finite automata

Details Exact generation of acyclic deterministic finite automata Exact generation of acyclic deterministic finite automata

2009-08-23

arxiv.org/abs/0908.3315v1

Computer Science

Formal Languages and Automata Theory

DCFS'08

Scientific paper

We give a canonical representation for trim acyclic deterministic finite automata (Adfa) with n states over an alphabet of k symbols. Using this normal form, we present a backtracking algorithm for the exact generation of Adfas. This algorithm is a non trivial adaptation of the algorithm for the exact generation of minimal acyclic deterministic finite automata, presented by Almeida et al.

Affiliated with

Also associated with

No associations

Rating

Exact generation of acyclic deterministic 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 Exact generation of acyclic deterministic finite automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact generation of acyclic deterministic finite automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-364194