Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
54 views1 page

Tutorial Sheet 2

The document contains 8 questions about constructing minimal deterministic finite automata (DFAs) to accept various languages over different alphabets. The questions cover topics like DFAs that accept strings based on prefixes, suffixes, substring occurrences, and relationships between counts of different letters.

Uploaded by

amsuperman977
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
54 views1 page

Tutorial Sheet 2

The document contains 8 questions about constructing minimal deterministic finite automata (DFAs) to accept various languages over different alphabets. The questions cover topics like DFAs that accept strings based on prefixes, suffixes, substring occurrences, and relationships between counts of different letters.

Uploaded by

amsuperman977
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/ 1

Tutorial 2

Ques 1: Construct minimal DFA for following.


a) That accept all string that starts with a.
b) That accept all string that starts with a and end with b.
c) That accept all string having at least one a.
d) That accept all string having exactly one a.
e) That accept all string having at most one a.
f) That accept all string having at least two a.
g) That accept all string having exactly two a.
h) That accept all string having at most two a.
i) That accept all string having starting and ending different letter.

Ques 2: Find the number of states in MDFA that accept all the string generated by (11+111)*, Ʃ = {1}.
Ques 3: Construct a minimal DFA which accept set of all strings over {a, b} in which number of a’s are
divisible by 3 and number of b’s are divisible by 2.
Ques 4: Construct a minimal DFA which accepts
L = {anbmcl | n,m,l >= 0}
Ques 5: Construct a transition system which can accept string over the alphabet a, b, c…z containing
either ‘cat’ or ‘rat’.

Ques 6: Construct DFA for following:


a) L= {ambn | m=n; m>= 1; n<= 2}
b) L= {ambn | m<n; m= 1, 2,3; n=1,2,3}
c) L= {ambn | m+n=2}
d) L= {ambn | m*n=2}
e) L= {an | n=2 or 4}
f) L= {w Ꞓ Ʃ*| |w|a =|w|b , |w|= 4, Ʃ={a,b}}
g) L= {x= wwR | wꞒ Ʃ*,|w|=4, Ʃ={a,b}}
h) L= { w Ꞓ Ʃ*| w=wR , |w|=3, Ʃ={a,b}}

Ques 7: Consider the following DFA

Which one of the following languages is accepted by DFA?


(a) L= {w: w ∈(a+b)* has either aa or bb as a substring}
(b) L= {w: w ∈(a+b)* has both aa or bb as substring}
(c) L= {w: w ∈(a+b)* has neither aa nor bb as a substring}
(d) None of these.

You might also like