Nondeterministic finite automaton: Difference between revisions

Content deleted Content added
Fix regex in NFA-ε example (counterexamples for previous regex: "001" or "110")
Tag: Reverted
Undid revision 1271119136 by Wp12897628 (talk): not needed, due to the outer stars
Tags: Undo Reverted
Line 187:
|}
<math>M</math> can be viewed as the union of two [[deterministic finite automaton|DFA]]s: one with states <math>\{S_1, S_2\}</math> and the other with states <math>\{S_3, S_4\}</math>.
The language of <math>M</math> can be described by the [[regular language]] given by this [[regular expression]] <math>(1^{*}01^{*}01^{*}0)^{*} \cup (0^{*}10^{*}10^{*}1)^{*}</math>.
We define <math>M</math> using ε-moves but <math>M</math> can be defined without using ε-moves.