The DFAs of Finitely Different Languages

Details The DFAs of Finitely Different Languages The DFAs of Finitely Different Languages

2007-02-09

arxiv.org/abs/cs/0702053v1

Computer Science

Computational Complexity

Scientific paper

Two languages are "finitely different" if their symmetric difference is finite. We consider the DFAs of finitely different regular languages and find major structural similarities. We proceed to consider the smallest DFAs that recognize a language finitely different from some given DFA. Such "f-minimal" DFAs are not unique, and this non-uniqueness is characterized. Finally, we offer a solution to the minimization problem of finding such f-minimal DFAs.

Affiliated with

Also associated with

No associations

Rating

The DFAs of Finitely Different Languages 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 The DFAs of Finitely Different Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The DFAs of Finitely Different Languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-8120