Scribd
Upload
22 views2 pages

2 Yr. B.Tech. - Computer Science & Engineering/Information Technology Theory of Automata and Formal Languages

This document outlines the examination structure for the Theory of Automata and Formal Languages course for B.Tech students. It includes a series of questions divided into five sections, covering topics such as Kleene Closure, DFA vs NFA, Pumping Lemma, Context-sensitive grammars, and the Church-Turing thesis. Each question requires detailed responses, with specific marks allocated to different parts.

Uploaded by

ukpaditji
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
22 views2 pages

2 Yr. B.Tech. - Computer Science & Engineering/Information Technology Theory of Automata and Formal Languages

This document outlines the examination structure for the Theory of Automata and Formal Languages course for B.Tech students. It includes a series of questions divided into five sections, covering topics such as Kleene Closure, DFA vs NFA, Pumping Lemma, Context-sensitive grammars, and the Church-Turing thesis. Each question requires detailed responses, with specific marks allocated to different parts.

Uploaded by

ukpaditji
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

Sub Code: BCST403/BEET405/BITT405 ROLL NO……………..……………..

EVEN SEMESTER EXAMINATION, 2023 – 24


2 yr. B.Tech. – Computer Science & Engineering/Information Technology
nd

Theory of Automata and Formal Languages

Duration: 3:00 Hrs. Max Marks: 100


Note: - Attempt all questions. All Questions carry equal marks. In case of any ambiguity or missing data,
the same may be assumed and state the assumption made in the answer.

Q 1. Answer any four parts of the following. 5x4=20


a) Discuss Kleene Closure and languages in Automata.
b) Explain productions with example.
c) Discuss Arden’s theorem with suitable example.
d) Create Chomsky hierarchy of languages.
e) How type 0 grammar is differing over type 1 grammar?
f) Explain the different closure properties of Recursive languages.

Q 2. Answer any four parts of the following. 5x4=20


a) Differentiate between DFA and NFA.
b) Construct a DFA and its transition table for the set of strings over the
∑= {0,1} that ends in 101.
c) Discuss the properties of regular languages.
d) Explain pumping lemma for regular languages.
e) Discuss minimization of finite automata.
f) How Moore machine is differing over Mealy machine?
Q 3. Answer any two parts of the following. 10x2= 20
a) Explain Pumping lemma for CFLs. Obtain a CFG for the language of palindrome
over the alphabet {a, b, c}.
b) Explain push down automata. Construct a PDA to accept a given language L by empty
store where L = {an bn | n>=1}
c) What is parse tree? Consider the grammar- S −> A 1 B
A −> 0A / ℇ
B −>0B /1B / ℇ
For the string w=00101, Identify the Leftmost derivation, Rightmost derivation and
parse tree.
Q 4. Answer any two parts of the following. 10x2= 20
a) Explain Context-sensitive grammars and languages. Examine the grammar:
S −> A / B
A −> a A b / ab
B −> a b B / ℇ
Identify whether the grammar is ambiguous or not.

b) Explain unrestricted grammars and equivalence with Turing machines.


c) Explain Chomsky and Greibach normal forms. Find a grammar in Chomsky normal form
equivalent to S−> aAbB, A−>a A/a, B−>b B/b
Q 5. Answer any two parts of the following. 10x2= 20
a) Explain about Church- Turing thesis and Universal Turing Machine.
b) Explain Post Correspondence problem and unsolvable decision problem.
c) What is Halting problem of TM? Design a Turing machine that erases all non-blank
symbols on the tape, over the alphabets ∑= {a,b}

**********

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy