Assignment 1
Assignment 1
Note : Student are requested to submit hand written scanned copy of the assignment on or before 22-
09-2021.
Q1. Construct a nondeterministic finite automaton accepting {ab,ba}, and use it to find a deterministic
finite automaton accepting the same set.
Q2. Construct a nondeterministic finite automaton accepting the set of all string over {a,b} ending in
aba. Use it to construct a DFA accepting the same set of strings.
Q3. Consider following transition table of non-deterministic finite automaton M where q0 is a initial
state and q3 is a final state. Construct a deterministic finite automaton equivalent to M.
Input
State
0 1 2
q0 {q1,q4} q4 {q2,q3}
q1 q4
q2 {q2,q3}
q3 q4
q4
Q4. What is Mealy and Moore machine. Also construct a Mealy machine which is equivalent to the
Moore machine define by following Table
Input
Present State Output
a=0 a=1
->q0 q1 q2 1
q1 q3 q2 0
q2 q2 q1 1
q3 q0 q3 1
Q6. Find the regular expression corresponding to the finite automaton show in the figure
Q7. Construct an NFA equivalent to the regular expression: 10 +(0+11) 0*1