Assertion: robot's input | /r/MadeOf | even number of 0s
Facets:
Source sentences:
text: The following example is of a DFA M {\displaystyle M} , with a binary alphabet, which requires that the input contains an even number of 0s.
text: If the input did contain an even number of 0s, M {\displaystyle M} will finish in state S 1 {\displaystyle S_{1}} , an accepting state, so the input string will be accepted.
text: Let M {\displaystyle M} be a NFA-ε, with a binary alphabet, that determines if the input contains an even number of 0s or an even number of 1s.