Scribd
Upload
12 views2 pages

BTech BTES

Solution paper

Uploaded by

Rakesh Prajapati
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
12 views2 pages

BTech BTES

Solution paper

Uploaded by

Rakesh Prajapati
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

Roll No. Total No.

of Pages : 02
Total No. of Questions : 09
B.Tech. (CSE) (Sem–5)
FORMAL LANGUAGE & AUTOMATA THEORY
Subject Code : BTCS 502-18
M.Code : 78321
Date of Examination : 08-06-2023
Time : 3 Hrs. Max. Marks : 60

INSTRUCTIONS TO CANDIDATES :
1. SECTION-A is COMPULSORY consisting of TEN questions carrying T WO marks
each.
2. SECTION-B contains FIVE questions carrying FIVE marks each and students
have to attempt any FOUR questions.
3. SECTION-C contains T HREE questions carrying T EN marks each and students
have to attempt any T WO questions.

SECTION-A

1. Write briefly :

a. Define Formal Language.

b. Write some applications of Automata theory.

c. Write regular expression for strings begins with 00 and ends with 11.

d. Why do we need lambda move in automata?

e. Every Type grammar is a Type 3 grammar (T/F). Justify your answer.

f. What is left recursion?

g. What is ambiguity in CFG?

h. Define LBA.

i. What is NP complete problem?

j. What is Church Turing thesis states?

1 | M-78321 (S2)-2359
SECTION-B

2. Explain the Chomsky hierarchy of grammars. Show the correspondence between the
automation and types of Grammar.

3. Discuss the procedure to convert NDFA to DFA with the help of suitable example.

4. What is parsing? How Left most and right most derivation helps to find out the ambiguity
in a CFG?

5. Discuss the concept of Pumping Lemma for regular grammars. How Pumping Lemma is
used to prove weather a given grammar is not a regular grammar?

6. What do you understand by tractable and Intractable problems with reference to Turing
Machines?

SECTION-C

7. What is Turing Machine? Explain the different variants of Truing Machines.

8. Discuss Push down Automation in detail. Design PDA for {wcwT | w={a,b}*}

9. Write a Short note on :

a. Minimization of FA

b. Cook Levin Theorem

NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any
page of Answer Sheet will lead to UMC against the Student.

2 | M-78321 (S2)-2359

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