Assignment question
unit -1
1.define DFA and NFA , explain the differences between them with an example
2.provide an NFA with atmost six states for the following language
L={w/w contains an even number of 0’s or exactly two 1’s}
3.construct a NFA accepting ab,ba and use it to find a DFA accepting same set.
4.draw the transition diagram for the FA M={(A,B,C,D),(0,1),δ,c,(A,C)}
δ(A,0)= ,δ(A,1)={A,B,C)
δ(B,0)=B, δ(B,1)={A,C}
δ(C,0)={B,C},δ(C,1)={B,D}
δ(D,0)={A,B,C,D}
δ(D,1)={A}
5.for the following state transition table, draw state transition diagram
find its equivalent DFA machine for string abbaaab , chech whether both give same result or not.
state 0
1
->q0 q1
q2
q1
q1
q1,q3
q2
q3
q0,q3 q3
note q3 is final state
unit -2
1.
2.
3.
4.
5.
construct an NFA accepting ab,ba and use it to find a DFA accepting the same set
differentiate between mealy and moor machine
construct a mealy machine which is equivalent to moore machine using some examples
explain the procedure to convert NFA to DFA with any example
explain the procedure to convert NFA with epsilon to NFA with out epsilon with any example
unit -3
1.explain the term regular set,regular expression and closure properties
2.what are the identity rules of Regular expression
3.prove that (a*ab+ba)*a*=(a+ab+ba)* use identity rules .
4.draw the NFA with epsilon recognizing regular expression 010*+0(01+10)*11.
5.convert the following Finite automata to Regular expression