0% found this document useful (0 votes)
43 views

Assignment 01

Assignment problem
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
43 views

Assignment 01

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

United International University (UIU)

Dept. of Computer Science & Engineering (CSE)


Assignment-01 || Summer 2024
CSE 2233/CSI 233: Theory of Computation/Theory of Computing
Total Marks: 10 Deadline: 20.09.24
Answer all questions. Figures are in the right-hand margin indicates full marks.

1. Design DFAs that accepts the following languages: 1x4

a) L = { w | w starts and ends with different symbol, having even length strings when
starts with a or odd length strings when starts with b} where, ∑ = {a,b}

b) L = { w | w starts with “ab”, contains “cca” as a substring and ends with “aba”}
where, ∑ = {a,b,c}

c) L = { w | w neither contains two consecutive a’s nor two consecutive b’s }


where ∑ = {a,b}

d) L = {w| w only accepts binary strings those are a multiple of 4.}


| Σ = {0, 1}

2. Design NFAs that accepts the following languages: 1x4

a) L= {w | w starts with “12” or “32” and contains “222” or “111” or “333” and ends
with “31” or “23”} | Σ = {1,2,3}

b) L= {w | w double “1” is followed by triple “0” and starts with “0”} | Σ = {0,1}

c) L= {w | w third symbol from the right end is always “a” and the second symbol is
either “b” or “c”} | Σ = {a,b,c}

d) L= contains „xx’ or „yx‟ or „zz‟ and ends with „yz‟ or „y‟ | ∑ = {x,y,z}

Page 1 of 2
3. Consider the following NFA, and show with the help of NFA-tree whether the string aabbbbaa 2
is accepted or not.

Page 2 of 2

You might also like