Scribd
Upload
2K views9 pages

Problems DFA

The document contains problems that ask to construct deterministic finite automata (DFAs) for various languages over different alphabets. It provides the regular expression for each language and outlines the steps to construct the DFAs, including determining the minimum number of states needed based on the length of the starting substring and constructing sample strings to build the DFA.

Uploaded by

Joseph Acebo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2K views9 pages

Problems DFA

The document contains problems that ask to construct deterministic finite automata (DFAs) for various languages over different alphabets. It provides the regular expression for each language and outlines the steps to construct the DFAs, including determining the minimum number of states needed based on the length of the starting substring and constructing sample strings to build the DFA.

Uploaded by

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

Problem-01:

Draw a DFA for the language accepting strings starting with ‘ab’ over input alphabets ∑ =
{a, b}

Solution-

Regular expression for the given language = ab(a + b)*

Step-01:

 All strings of the language starts with substring “ab”.


 So, length of substring = 2.

Thus, Minimum number of states required in the DFA = 2 + 2 = 4.


It suggests that minimized DFA will have 4 states.

Step-02:

We will construct DFA for the following strings-


 ab
 aba
 abab

Step-03:

The required DFA is-


Problem-02:

Draw a DFA for the language accepting strings starting with ‘a’ over input alphabets ∑ = {a,
b}

Solution-

Regular expression for the given language = a(a + b)*

Step-01:

 All strings of the language starts with substring “a”.


 So, length of substring = 1.

Thus, Minimum number of states required in the DFA = 1 + 2 = 3.


It suggests that minimized DFA will have 3 states.
Step-02:

We will construct DFA for the following strings-


 a
 aa

Step-03:

The required DFA is-

Problem-03:

Draw a DFA for the language accepting strings starting with ‘101’ over input alphabets ∑ =
{0, 1}

Solution-

Regular expression for the given language = 101(0 + 1)*


Step-01:

 All strings of the language starts with substring “101”.


 So, length of substring = 3.

Thus, Minimum number of states required in the DFA = 3 + 2 = 5.


It suggests that minimized DFA will have 5 states.

Step-02:

We will construct DFA for the following strings-


 101
 1011
 10110
 101101

Step-03:

The required DFA is-


Problem-04:

Draw a DFA that accepts a language L over input alphabets ∑ = {0, 1} such that L is the set
of all strings starting with ’00’.

Solution-

Regular expression for the given language = 00(0 + 1)*

Step-01:

 All strings of the language starts with substring “00”.


 So, length of substring = 2.

Thus, Minimum number of states required in the DFA = 2 + 2 = 4.


It suggests that minimized DFA will have 4 states.

Step-02:

We will construct DFA for the following strings-


 00
 000
 00000

Step-03:

The required DFA is-


Problem-05:

Construct a DFA that accepts a language L over input alphabets ∑ = {a, b} such that L is
the set of all strings starting with ‘aa’ or ‘bb’.

Solution-

Regular expression for the given language = (aa + bb)(a + b)*

Step-01:

Minimum number of states required in the DFA = 5.


It suggests that minimized DFA will have 5 states.

Step-02:

We will construct DFA for the following strings-


 aa
 aaa
 aaaa
 bb
 bbb
 bbbb

Step-03:

The required DFA is-

Problem-06:

Construct a DFA that accepts a language L over input alphabets ∑ = {a, b} such that L is
the set of all strings starting with ‘aba’.

Solution-

Regular expression for the given language = aba(a + b)*


Step-01:

 All strings of the language starts with substring “aba”.


 So, length of substring = 3.

Thus, Minimum number of states required in the DFA = 3 + 2 = 5.


It suggests that minimized DFA will have 5 states.

Step-02:

We will construct DFA for the following strings-


 aba
 abaa
 abaab
 abaaba

Step-03:

The required DFA is-

You might also like