Theory of computations - Handout 2

A _____________ is a state where the control can enter and be confined. There is no way out of a _____________

(a)  

A finite automaton is said to be (a)   if there exists a single path for specific input from the current state to the next state

There is only one path for the input from the current state to the next state

(a)  

It does not accept a null move, such as a change in state without any input character

(a)  

It can contain multiple final states, which is commonly used in a lexical analysis in a compiler

(a)  

A finite automaton is said to be (a)   if many paths exist for specific input from the current state to the next state

The exact state to which the machine moves cannot be determined

(a)  

Every NFA is not DFA, but every NFA can be translated to DFA

(a)  

The transition from a state is through a single next state for each input symbol

(a)  

The transition from a state can be in multiple next states for each input symbol

(a)