Important Questions

Q.1 Define finite automata.

Ans. Definition of FA

A finite automaton is a collection of 5-tuple (Q, ∑, δ, q0, F), where:

1. Q: finite set of states

2. ∑: finite set of the input symbol
3. q0: initial state
4. F: final state
5. δ: Transition function

Q.2 Construct a deterministic finite automata equivalent to

M = ({q0,q1,q2,q3},{0,1},δ, q0,{ q3}) where δ is given by table

Ans
 Q.3 Convert the following moore machine into its equivalent mealy machine.

Present State Next State Output

a=0 a=1
 q1 q1 q2 0
q2 q1 q3 0
q1 q3 1
q3

Ans.

Q.4 Construct the minimum state automaton equivalent to the given transition diagram

.
Ans.