Scribd
Upload
33 views1 page

A 1

The document provides problems related to automata theory and regular languages including designing DFAs and NFAs for specific languages, proving properties of regular expressions, determining if sets are regular, and questions related to pumping lemmas and semilinear sets.

Uploaded by

Houssem Nasri
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
33 views1 page

A 1

The document provides problems related to automata theory and regular languages including designing DFAs and NFAs for specific languages, proving properties of regular expressions, determining if sets are regular, and questions related to pumping lemmas and semilinear sets.

Uploaded by

Houssem Nasri
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

CSL COL Intro to Automata and Theory of Computation, Tutorial Sheet 1

1. Design DFA for the following languages over {0, 1}


(a) The set of all strings such that every block of of five consecutive symbols have at least two 0’s.
(b) The set of all strings beginning with a 1 which interpreted as an integer is congruent to zero modulo 5.
(c) The set of strings with an equal number of 0’s and 1’s such that each prefix has atmost one more 0 than
1’s and at most one more 1 than 0’s.
(d) The set of strings not containing the substring 110.
2. Design NFA for the following languages
(a) The set of strings over {0, 1} such that some pair of 0’s is seprated by a string of length 4i i ≥ 0.
(b) The set of strings over {a, b} that have the same value when multiplied from left to right as from left to
right. The rules of multiplication are a×a = b, b×b = a, a×b = b, b×a = b. Note that ((a×b)×b) = a
and (a × (b × b)) = b, i.e. they are not same, i.e. it is not associative.
(c) The set of strings of the form {x · w · xR |x, w are strings over 0,1 of non-zero length}
3. Prove of disprove the following about regular expressions r, s, t where r = s implies L(r) = L(s)
(a) r(s + t) = rs + rt
(b) (r∗ )∗ = r∗
(c) (r∗ s∗ )∗ = (r + s)∗
(d) (r + s)∗ = r∗ + s∗
4. Which of the following are regular sets - Prove them
n
(a) {02 |n ≥ 1}
(b) 0m 0n 0m+n |m, n ≥ 1}
(c) {0n |n is prime }
(d) The set of all strings with equal number of 0s and 1’s.
(e) Set of all palindromes over 0,1.
(f) {xxR w|x, w ∈ (0 + 1)+ }
5. Let L be a regular set. Which of the following are regular
(a) {a1 a3 . . . a2n−1 |a1 a2 a3 . . . a2n is in L}
(b) M AX(L) = {x is in L| no extension of x is in L}
(c) LR = {x|xR is in L}
(d) 12 (L) = {x| for some y such that |x| = |y|, xy ∈ L}.

6. A set of integers is linear if it is of the form {c + p · i|i ≥ 0}. A set is semilinear if it is a finite union of linear
sets. Let R ⊂ 0∗ be regular. Prove that R is semilinear.
7. What is the relationship between class of regular sets and the least class of languages closed under union,
intersection and complement containing all finite sets ?
8. What will be the statement of the converse of Pumping Lemma for regular language ?
What does it imply for the language {0i · 1j · 2k } where i = 0 or j = k ?

You might also like