Scribd
Upload
62 views5 pages

Assignment 4 (1) - Theory of Computation

This document contains 30 problems asking to design deterministic finite automata (DFAs) or write regular expressions to describe various languages over binary or other alphabets. The problems involve languages with constraints on string length, symbol counts, substring inclusion/exclusion, and other properties.

Uploaded by

Khushi Agarwal
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
62 views5 pages

Assignment 4 (1) - Theory of Computation

This document contains 30 problems asking to design deterministic finite automata (DFAs) or write regular expressions to describe various languages over binary or other alphabets. The problems involve languages with constraints on string length, symbol counts, substring inclusion/exclusion, and other properties.

Uploaded by

Khushi Agarwal
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/ 5

Assignment-4

1) Design a DFA which accepts a language L = {w| w is of even length and


begins with 01}.
2) Design a DFA which accepts all string such that number of a’s is even and
number of b’s is a multiple of 3.
3) Design a DFA which accepts set of all strings not containing “110”.
4) Design a DFA which accepts set of all strings that begins with 01 and end
with 11.
5) Design a DFA which accepts set of all binary strings over 0 and 1 who’s
decimal equivalent is multiple of 3.
6) Design a DFA which accepts set of all binary strings over 0 and 1 who’s
decimal equivalent is multiple of 5.
7) Design a DFA which accepts a language L = {w| w has length at least 3 and
its third symbol is “0”}.
8) Design a DFA which accepts all strings containing even number of “0” or
exactly three 1’s.
9) Design a DFA which accepts a language L = {w| Na(w) mod 6 != 0 & Nb(w)
mod 7 = 1}.
10) Design a DFA which accepts a language L = {w| Na(w) mod 3 = 0 or Nb(w)
mod 4 = 2}.
11) Design a DFA which accepts a language L = {w | w contains at least two 0’s
and at most one 1’s}
12) Design a DFA which accepts all strings containing at least one “1” and at
least one “0”.
13) Minimize the given DFA

14) Minimize the given DFA

q
4
15) Minimize the given DFA

16) Minimize the given DFA


17) Minimize the given DFA

18) Minimize the given DFA


19) Write the regular expression for the following language over {a,b}
a- The set of all strings that has exactly one “a”.
b- The set of all strings that has at least one “a”.
c- The set of all strings that has at most one “a”.
d- The set of all strings that has at least two “a”.
20) Write regular expression which accept all strings starting with 001 over
{0,1}
21) Write regular expression which accept all strings not starting with “001”.
22) Write regular expression which accept all strings not starting with “01”.
23) Write regular expression which accept all strings starting and ending with
“a” over {a,b}.
24) Write regular expression which accept all strings starting with “11” and
ending with “11” over {0,1}.
25) Write regular expression which accept all strings starting and ending with
different number over {0,1}.
26) Write regular expression to accept all strings which have “0” at first
position and “1” at third position over {0,1}. As- 00111100
27) Write regular expression which accept all strings with odd number of a’s
over {a,b}.
28) Write regular expression which accept all strings with even number of a’s
over {a,b}.
29) Write regular expression which accept LanguageL= {w| |w|mod 3=0}
over{0,1}
30) Write regular expression which accept LanguageL= {w| |w|mod 3=2} over
{0,1}

You might also like