« Write Your Own Regular Expression Parser | Main | Automata Library for Haskell »

September 8, 2007

Now I just gotta find the suckers...

Given two DFAs there are efficient algorithms to find a DFA recognizing the union, intersection, and complements of the languages they recognize. There are also efficient algorithms to determine whether a DFA accepts any strings, whether a DFA accepts all strings, whether two DFAs recognize the same language, and to find the DFA with a minimum number of states for a particular regular language.

Posted by wincent at September 8, 2007 7:31 PM