Scribd
Upload
21 views

Assignment 2

This document outlines the CST 301 assignment II, which includes tasks related to Turing machines, context-sensitive languages, and formal language theory. Students are required to design Turing machines for specific languages, discuss various concepts such as decidable languages and the Chomsky hierarchy, and prove properties related to context-free languages. The assignment must be submitted by November 4, 2024.

Uploaded by

JEAN ROGER
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
21 views

Assignment 2

This document outlines the CST 301 assignment II, which includes tasks related to Turing machines, context-sensitive languages, and formal language theory. Students are required to design Turing machines for specific languages, discuss various concepts such as decidable languages and the Chomsky hierarchy, and prove properties related to context-free languages. The assignment must be submitted by November 4, 2024.

Uploaded by

JEAN ROGER
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

CST301

CST 301: FORMAL LANGUAGES AND AUTOMATA THEORY

ASSIGNMENT II

Submit on or before November 4, 2024


1 Turing Machine as a language acceptor: Design a TM to accept 𝐿 = {𝑎𝑛 𝑏𝑛 𝑐 𝑛 |𝑛 ≥ 1} (5) CO4

2 Turing machine as transducer: Design a Turing machine to multiply two numbers. State your (5) CO4
assumptions and write your logic

3 Turing machine as transducer: Design a Turing machine to compute 𝑚 − 𝑛 (5) CO4

4 Define Turing Machine. Discuss the instantaneous description of the Turing machine in
detail and illustrate with a simple example.
5 Discuss the modifications of Turing machines: Two way infinite tape, Multi-tape,
nondeterministic Turing machines, multi-dimensional Turing machines, multi-head Turing
machines, Offline Turing machines.
6 Define LBA. Design an LBA for the langugae 𝐿 = {𝑎 𝑛 𝑏𝑛 𝑐 𝑛 |𝑛 ≥ 1} (5) CO4

7 Discuss the notion of decidable and undecidable languages. (5) CO5

8 Discuss the importance of Universal Turing Machine by giving clearly the working (5) CO5
concept and execution pattern

9 Prove that for every PDA accepted by empty stack, there exists an equivalent (5) CO4
PDA accepted by final state.
10 Compare recursive and recursively enumerable languages (5) CO5
11 Illustrate with proper example the Chomsky Hierarchy of formal languages (5) CO5
12 Define Context Sensitive Languages. Give a CSG for the language 𝐿 = (5) CO1
{𝑎 𝑛 𝑏𝑛 𝑐 𝑛 |𝑛 ≥ 1} and illustrate the derivation of string 𝑎4 𝑏4 𝑐 4

13 Is the following grammar ambiguous? (5) CO3


𝑆 → 𝑎𝐴𝑆|𝑎, 𝐴 → 𝑆𝑏𝐴|𝑆𝑆|𝑏𝑎
14 Is the following grammar ambiguous? (5) CO3
𝑆 → 𝐴𝑆|𝜖, 𝐴 → 𝐴1|0𝐴1|01
15 Discuss the concept of ambiguity in detail. Mention the concept of inherently (5) CO3
ambiguous grammar.
16 Find a Greibach Normal Form grammar equivalent to the following CFG: (5) CO3
𝑆 → 𝐴𝐴|0, 𝐴 → 𝑆𝑆|1
17 Define PDA. Discuss instantaneous description of PDA in detail with an example. (5) CO4
18 Discuss deterministic PDA. How DPDA differ from its non deterministic version? (5) CO4
19 Is it possible to design a DPDA for the language𝐿 = {𝑤 ⬚ 𝑤 𝑅 |𝑤 ∈ {𝑎, 𝑏}∗ } (5) CO4
20 State and prove any THREE closure properties of CFL (5) CO4
21 State and give a formal proof of HALTING problem of Turing machines (5) CO5
22 Compare recursive and recursively enumerable languages (5) CO5

You might also like