CMR Institute of Technology, Bangalore

Department(s): Computer Science & Engineering

Semester: 05 Section(s): A,B & C Lectures/week: 05
Subject: Automata Theory And Computability Code: 17CS54
Course Instructor(s): Sagarika Behera, Savitha S

Assignment No 1

Question Marks CO RBT

1) A. Explain computational methods for specifications of a [6] + CO1 L1
language. [4]

B. Define the following terms : (i) Alphabet (ii) String (iii)

Power of an alphabet (iv) Language

2) Give DFSM’s accepting the following languages over the [10] CO1 L3
alphabet {0,1}.
a. The set of all strings ending in 00.
b. The set of all strings with three consecutive 0’s ( not
necessarily at the end.).

3) Design DFSM accepting the following languages over alphabet [10] CO1 L3
{a,b}
a. L= {w:|w| mod 5 < > 0}
b. L={w:na(w) mod 3 > nb(w) mod 3}
4) Convert the following NDFSM N=({p,q,r,s},{0,1},ᵟ,{p},{r,s}) [10] CO1 L3
to a DFSM. Where ᵟ is:
ᵟ(p,0)={p,r}, ᵟ(p,1)={q}, ᵟ(q,0)={r,s}, ᵟ(q,1)={p},
ᵟ(r,0)={p,s}, ᵟ(r,1)={r},
ᵟ(s,0)={q,r}, ᵟ(s,1)=Φ

5) A. Prove that if there is an NDFSM for L , there is an equivalent [6] + CO1 L2

DFSM for L. [4]
B. Give a new real life example each for Moore and Mealy
machines.
CMR Institute of Technology, Bangalore
Department(s): Computer Science & Engineering
Semester: 05 Section(s): A,B & C Lectures/week: 05
Subject: Automata Theory And Computability Code: 17CS54
Course Instructor(s): Sagarika Behera, Savitha S

Assignment No 2

Question Marks CO RBT

1) Describe in English , the language defined by each of these regular [4] + CO2 L2
expressions: [6]
a. (bUba)(bUa)*(abUb)
b. ((a*b*)*ab)U((a*b*)*ba)
2) Prove that every language defined by a regular expression is also
defined by FSM.

3) Define a regular expression. And find the regular expression for [10] CO2 L2
the following languages on {0,1}.
i) Strings with an odd number of 1’s.
ii) Strings which is having exactly three number of
1’s.
iii) Strings containing even number of 0’s.
iv) Strings not ending with 001.
v) Strings containing exactly one 0.
vi) Strings containing not more than three 0’s.

4) Show a DFSM to accept the language defined by each of the [6] + CO2 L3
following regular expressions: [4]
a. (ab)*(aab)* b. (0+1)*001 c. (a*+b*+c*)

5) Prove by construction that the regular languages are closed under:

a. Intersection b. Set difference

6) Show a regular grammar for each of the following languages: [10] CO3 L2
i) {w Ɛ {a,b}*: w contains an even no. of a’s and an odd no. of b’s}
ii) {w Ɛ {a,b}*: w contains the substring abb}

7) Prove the following languages are regular or not. [10] CO3 L2

i) {aibj : i,j≥0 and i+j=5} ii) { w=xyzyRx: x,y,z Ɛ {a,b}*} iii) {
w=xyzy: x,y,z Ɛ {0,1}+}
CMR Institute of Technology, Bangalore
Department(s): Computer Science & Engineering
Semester: 05 Section(s): A,B & C Lectures/week: 05
Subject: Automata Theory And Computability Code: 17CS54
Course Instructor(s): Sagarika Behera, Savitha S

Assignment No 3

Question Marks CO RBT

1) Define a Context-free grammar. Construct a CFG for the following [10] CO3 L2
languages
(a) L={anbmck : n+2m=k } (b) L={ai bj ck |i=j+k , ∑={a,b,c}} ( c )
L={ anbnck: k ≥3}

2) Define a PDA. Construct PDA for the following language by empty [10] CO4 L1,L3
stack.
L= {W|W consists of equal no. of 0’s and 1’s} over
Ʃ={0,1}.Write Instantaneous description (ID) for the string
001011.

examples: [5] CO4 L1

3)Explain the following with suitable

(i) Leftmost derivation (ii) Rightmost derivation (iii) Parse tree (iv)
Yield of a parse tree

4)State and prove Pumping Lemma for Context free language. [5] CO4 L2
5) State and prove Pumping Lemma for Context free language. [10] CO5 L2
6) Define linear bounded automata (LBA)? When do we say that a [5] CO5 L1
string is accepted by a LBA?
7) Write short notes on Multi tape TM and Universal TM. [5] CO5 L1