Scribd
Upload
1K views28 pages

DFA - Problems With Solutions

This document provides instructions for drawing deterministic finite automata (DFAs) to accept various languages over different alphabets. It includes examples of DFAs to accept strings with certain substring or length requirements, as well as homework problems providing additional practice with DFA construction.

Uploaded by

Lahari Tummalapalli
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
1K views28 pages

DFA - Problems With Solutions

This document provides instructions for drawing deterministic finite automata (DFAs) to accept various languages over different alphabets. It includes examples of DFAs to accept strings with certain substring or length requirements, as well as homework problems providing additional practice with DFA construction.

Uploaded by

Lahari Tummalapalli
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 28

Draw a DFA to accept string consisting of

atleast one ‘a’.

Q={ }
∑ = {a} a
Q0 δ
F
δ
Draw a DFA to accept string consisting of a’s
and b’s with atleast one a.

Q={ }
∑= {a, b} δ
a b
Q0
F
Draw a DFA to accept string consisting of a’s
and b’s having exactly one a.

Q={ }
∑ δ
a b
Q0
F
Draw a DFA to accept string consisting of a’s and b’s
starting with the string ab.

• Q={ }
•∑
• Q0
•F
Draw a DFA to accept the language.
L={w|w is of even length & beginning with
01}
DFA which accepts any number of a’s followed by
a string ba and followed by string of a’s & b’s
Obtain a DFA to accept string of a’s & b’s
having a substring aa
Obtain a DFA to accept string of a’s & b’s
ending with the string ab
Draw a DFSM to accept string of 0’s & 1’s
ending with the string 011
Obtain a DFA to accept string of a’s & b’s
expect those containing the substring aab
Obtain a DFA to accept string of 0’s & 1’s
having three consecutive 0’s
Obtain a DFA to accept string of a’s & b’s
having atleast four a’s
Obtain a DFA to accept string of a’s & b’s
having not more than three a’s
Obtain a DFA to accept the language
L={awa|w(a+b)*}
Draw a DFA to accept string of a’s and b’s
ending with ab or ba
Home Work
1. Obtain a DFA to accept strings of a’s and b’s
having a substring ab
2. Obtain a DFA to accept strings of a’s and b’s
which do not end with the string ab
3. Draw a DFA to accept string of 0’s and 1’s having
no 3 consecutive 0’s
4. Draw a DFA to accept strings of a’s and b’s having
exactly three ‘a’ s
Obtain a DFA to accept strings of a’s and b’s having a substring ab
Obtain a DFA to accept strings of a’s and b’s which do not end with
the string ab
Draw a DFA to accept string of 0’s and 1’s having no 3 consecutive
0’s
Draw a DFA to accept strings of a’s and b’s having exactly three ‘a’ s
Draw a DFA to accept string of a’s and b’s such
that no two consecutive characters are same
Draw a DFA to accept an integer with
optional sign
Draw a DFA to accept a floating point
number with optional sign
Obtain a DFA to accept strings of 0’s, 1’s and 2’s
beginning with a ‘0’ followed by odd number of 1’s and
ending with a 2
Obtain a DFA to accept strings of a’s and b’s
with at most two consecutive b’s
Obtain a DFA to accept strings of 0’s and 1’s starting
with at least two 0’s and ending with at least two 1’s
Obtain a DFA to accept the language
L={wbab} | w ∈ {a, b}*
Draw a DFA to accept set of all strings on the alphabet
∑= {0,1} that either begins or ends or both with the
substring 01

You might also like