¡@
c++ Programming Glossary: nfaDesign a nondeterministic finite automata in c++ (incorrect output) http://stackoverflow.com/questions/10626414/design-a-nondeterministic-finite-automata-in-c-incorrect-output automaton share improve this question Evaluating an NFA is almost as easy as evaluating a DFA. In a DFA you have one.. the current state is an accepting state. Well in an NFA you have a set of current states and in each step you go through..
How can you detect if two regular expressions overlap in the strings they can match? http://stackoverflow.com/questions/1849447/how-can-you-detect-if-two-regular-expressions-overlap-in-the-strings-they-can-ma from each one a nondeterministic finite state automaton NFA that compactly encodes all the strings that the RE matches... all the strings that the RE matches. Given any pair of NFA it's decidable whether their intersection is empty. If the intersection.. if you've already shown how to compute the complement of a NFA then you can DeMorgan's law style get the intersection by complement..
|