0% found this document useful (0 votes)
12 views2 pages

Assignment2(TOC)_2024

This notice outlines the 2nd assignment for the Theory of Computation course at Padre Conceicao College of Engineering, due on November 25, 2024. It includes various tasks such as converting grammars to Chomsky Normal Form, deriving strings, constructing Turing machines, and generating context-free grammars. The assignment is supervised by faculty member Megha Vishant Ainapurkar.

Uploaded by

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

Assignment2(TOC)_2024

This notice outlines the 2nd assignment for the Theory of Computation course at Padre Conceicao College of Engineering, due on November 25, 2024. It includes various tasks such as converting grammars to Chomsky Normal Form, deriving strings, constructing Turing machines, and generating context-free grammars. The assignment is supervised by faculty member Megha Vishant Ainapurkar.

Uploaded by

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

Padre Conceicao College of Engineering, Verna - Goa

Department of Information Technology

11th Nov 2024


NOTICE : 2nd Assignment in THEORY OF COMPUTATION

Class : TE IT RC 2019-20 (V)


Subject : IT520 THEORY OF COMPUTATION
Faculty in charge : Megha Vishant Ainapurkar

Instructions : Submit by 25th Nov 2024.

Sr Question/Numerical Marks Co CL
N
o
1 Convert the following grammar into CNF 5 IT CL
S → 0A | 1B 7.2 . 2
3
A → 0AA | 1S | 1
B → 1BB| 0S | 0

2 Consider the grammar given below 5 IT CL


E→E+E|T 7.2. 2
3
T→T*F|F
F→(E)|a|b
Give the derivation in both derivation form and parse tree
for the string w=(a+b)*a+b

3 Obtain grammar to generate the following language 5 IT CL


n 2n 7.2. 3
i) L= { a b , n≥1} 3
r
ii) L= { ww where w {a,b} * }

4 Construct a Turing machine that recognizes the language 5 IT CL


Padre Conceicao College of Engineering, Verna - Goa
Department of Information Technology

L= {xx| x €{a,b}*} 7.2. 3


4
5 Generate a CFG corresponding to the following PDA 5 IT CL
∂(q0, 0, Z0)=(q0, XZ0) 7.2. 2
3
∂(q0, 0, X)=(q0, XX)
∂(q0, 1, X)= (q1, ↋)
∂(q1, 1, X)= (q1,↋)
∂(q1,↋ , X)= (q1,↋)
∂(q1, ↋, Z0)= (q1,↋)

6 State and explain the Chomsky heirarchy 5 IT CL


7.2 . 1
4
7 Obtain an unrestricted grammar generating the language L= {a 2k | 5 IT CL
k € N} 7.2 . 3
4

Megha Vishant Ainapurkar


Assistant Professor, Information Technology Dept.
Padre Conceicao College of Engineering,
Verna,Goa India

You might also like