Question: 4. Here is a nondeterministic finite automaton: Some input strings lead to more than one state. Find, in the list below, a string that leads
| 4. | Here is a nondeterministic finite automaton:
Some input strings lead to more than one state. Find, in the list below, a string that leads from the start state A to three different states (possibly including A). |
|
|
| a) | 1110 |
|
| b) | 0010 |
|
| c) | 01100 |
|
| d) | 010011 |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
