Nondeterministic finite automaton: Difference between revisions

Content deleted Content added
m The subsection ===Recognized language=== just below assumes the definition of NFA without epsilon-moves. The definition of NFA with epsilon-moves is in the section ==NFA with ε-moves==.
Line 211:
:*If <math>\delta'^*(q_0,w)</math> contains a state in <math>F' \setminus \{ q_0 \} ,</math> then <math>\delta^*(q_0,w)</math> contains the same state, which lies in <math>F</math>.
:*If <math>\delta'^*(q_0,w)</math> contains <math>q_0 ,</math> and <math>q_0 \in F ,</math> then <math>\delta^*(q_0,w)</math> also contains a state in <math>F ,</math> viz. <math>q_0 .</math>
:*If <math>\delta'^*(q_0,w)</math> contains <math>q_0 ,</math> and <math>q_0 \not\in F ,</math> but <math>q_0\in F',</math> then {{clarifythere span|theexists a state in <math>E(q_0) \cap F</math>|reason=Which, one?and Whythe should such asame state exist?|date=April 2022}} must be in <math display=inline>\delta^*(q_0,w) = \bigcup_{r \in \delta^*(q,v)} E(\delta(r,a)) .</math><ref name="Hopcroft.Ullman.1979"/>{{rp|26-27}}
 
Since NFA is equivalent to DFA, NFA-ε is also equivalent to DFA.