Nondeterministic finite automaton: Difference between revisions

Content deleted Content added
No edit summary
Example: Improve mobile view
Tags: Mobile edit Mobile web edit
Line 153:
Let <math>M</math> be a NFA-ε, with a binary alphabet, that determines if the input contains an even number of 0s or an even number of 1s. Note that 0 occurrences is an even number of occurrences as well.
 
In formal notation, let <math display=block>M = (\{S_0, S_1, S_2, S_3, S_4\}, \{0, 1\}, \delta, S_0, \{S_1, S_3\})</math> where
the transition relation <math>\delta</math> can be defined by this [[state transition table]]:
{| class="wikitable" style="margin-left:auto;margin-right:auto; text-align:center;"