Finite State Automata
The following questions concern both deterministic and non-deterministic finite state automata.
Finite state machine basics
From the following statements select all that are true.
- The alphabet of a finite state machine is finite.
- A finite state machine must have an accepting state.
- A finite state machine may have more than one start state.
- The empty sting (6) is accepted by every finite state machine.
- A finite state machine may either accept, reject or decline a string.
- A finite state machine accepts a string when the machine transitions to an accepting
state.
- A finite state machine will terminate on every input.