Question

Automata Theory and Formal Languages

Instructions: Draw the DFA (Deterministic Finite Automaton) of the following:

1. DFA in which start and end symbol must be different
2. Design a DFA in which start and end symbol must be same
3. DFA in which every 'a' should be followed by 'b'
4. DFA in which every 'a' should never followed by 'b'
5. DFA in which every 'a' should followed by 'bb'
6. DFA in which every 'a' should never followed by 'bb'
7. DFA for aⁿb^m| n,m ≥ 1
8. DFA for aⁿb^m| n,m ≥ 0
9. DFA for aⁿb^mc^l| n,m,l ≥ 1
10. DFA for aⁿb^mc^l| n,m,l ≥ 0
11. DFA such that second sybmol from L.H.S. should be 'a'

Answer 1

if you have any doubt, feel free to ask in the comments.