Content deleted Content added
Missing paths - still deterministic? |
|||
Line 44:
[[Image:DFA search mommy.svg|300px|right]]
I've just fixed up the DFA image [[:Image:DFA search mommy.svg]] so that it renders again. It's intended for [[string search algorithm]] but may be useful here. [[User:Dcoetzee|Dcoetzee]] 03:57, 2 April 2007 (UTC)
==Missing paths - still deterministic?==
The definition for DFA states that there should be ''one and only one'' transition for each pair of states and inputs. The definition for NFA only addresses the case of a single input leading to multiple, different states. What about the case where an input leads off to a "dummy state" that just loops back to itself on every input? If we just eliminate the dummy state and any inputs leading to it, does the diagram still represent a DFA? If not, is it an NFA? Or something else? Thanks, [[User:Maghnus|Maghnus]] 15:25, 29 October 2007 (UTC)
| |||