Unit 1
Unit 1
Σ={a,b}
Construct a DFA which accepts all strings over (0,1)
in which second symbol is ‘0’ and fourth symbol ‘1’
Construct a DFA ending with even
no. of ‘a’ and even no. of ‘b’,
Σ={a,b}
Construct a DFA ending with odd no.
of ‘a’ and odd no. of ‘b’, Σ={a,b}
Construct a DFA ending with even
no. of ‘a’ and odd no. of ‘b’,
Σ={a,b}
Construct a DFA ending with odd no.
of ‘a’ and even no. of ‘b’, Σ={a,b}
Eliminate Є-moves
Rules:
1. Find all edges starting from S2
2. Duplicate all edges to S1 without changing edge labels
3. If S1 is initial state, make S2 initial
4. If S2 is final state, make S1 final
5. Remove Dead state
Equivalence of DFA
Moore Machine
N input n+1 output
00110 aaabaa
Moore to Mealy Conversion
Moore to Mealy Conversion
Mealy-Moore Machine
Mealy-Moore Machine
Minimization of DFA
Regular Language
Regular Language is the one which is accepted at Finite Automata and
Regular Expressions represents Regular Language