Theory Of Computation

Assignment-1
Q 1 Write a operations of language in finite automata.
Q2 Convert the following moore machine into its equivalent mealy machine.

Present State Next State Output

a b
 q0 q1 q2 1
q1 q3 q4 1
q2 q4 q0 0
q3 q1 q2 0
q4 q3 q0 1

Q.3.Convert the following NFA with ^ - moves to its equivalent DFA.

State Input
x y z ^
 q0 q0 ɸ ɸ
q1
q1 ɸ q1 q2
q2 ɸ
ɸ ɸ q2 ɸ

Q.4 Explain Arden’s Theorem in detail.

Q.5 State and explain pumping lemma for regular sets.