Content deleted Content added
WPCS |
→Possible error in example: new section |
||
Line 57:
:Missing paths are no big deal; the definition of what it means to run such an automaton will most likely say that if a path is missing, the automaton immediately halts (this can be simulated by adding an extra state and a new path to this state for each missing path in the original automaton). So long as there are never two paths on the same state/input pair, the automaton is deterministic. — Carl <small>([[User:CBM|CBM]] · [[User talk:CBM|talk]])</small> 03:21, 23 December 2007 (UTC)
== Possible error in example ==
In the section "Advantages and Disadvantages", the example discribes the "bracket" language - i.e. properly paired brackets. This is not formally ''a<sup>n</sup>b<sup>n</sup>'', as stated, but "Strings whose each prefix has more or equal a's than b's" [[User:Raghunandan ma|Raghunandan ma]] ([[User talk:Raghunandan ma|talk]]) 10:18, 16 August 2011 (UTC)
| |||