Revision as of 00:09, 29 February 2024 edit 192.38.10.58 (talk) →The input symbols for a NFA is Sigma unioned with epsilon, otherwise we cannot take any epsilon transitions because it is not in the symbol. From the cite (Sipser): "For any alfabet Sigma we write Sigma_epsilon to be Sigma union epsilon." ← Previous edit		Revision as of 00:16, 29 February 2024 edit undo 192.38.10.58 (talk) →Nfa and nfa-epsilon is not the same. Next edit →
Line 29: <math>(Q, \Sigma, \delta, q_0, F)</math>, consisting of * a finite [[Set (mathematics)\|set]] of states <math>Q</math>. * a finite set of [[input symbol]]s <math>\Sigma</math> ~~where <math>\Sigma \cup \epsilon </math>.~~ * a transition function <math>\delta</math> : <math>Q\times\Sigma \rightarrow \mathcal{P}(Q)</math>. * an ''initial'' (or ''start'') state <math>q_0 \in Q</math>.

Nondeterministic finite automaton: Difference between revisions