Scribd
Upload
158 views3 pages

KIET Group of Institutions: PUE (MAKEUP) Examination (2021-2022) EVEN Semester

This document contains an exam for the course Theory of Automata and Formal Languages. The exam has three sections. Section A contains short answer questions about automata theory concepts. Section B contains longer questions about finite automata, regular expressions, and context-free grammars. Section C contains application questions involving minimizing DFAs, converting between models of computation, and solving computational problems using Turing machines. The exam tests students on key concepts from automata theory at a conceptual level with an emphasis on procedural knowledge and skills.

Uploaded by

akttripathi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
158 views3 pages

KIET Group of Institutions: PUE (MAKEUP) Examination (2021-2022) EVEN Semester

This document contains an exam for the course Theory of Automata and Formal Languages. The exam has three sections. Section A contains short answer questions about automata theory concepts. Section B contains longer questions about finite automata, regular expressions, and context-free grammars. Section C contains application questions involving minimizing DFAs, converting between models of computation, and solving computational problems using Turing machines. The exam tests students on key concepts from automata theory at a conceptual level with an emphasis on procedural knowledge and skills.

Uploaded by

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

Roll No.

___________________

KIET Group of Institutions


PUE (MAKEUP) Examination (2021-2022) EVEN Semester

Department: Department of Computer Applications


Course: MCA
Year: Ist Semester: 2nd
Subject Name: Theory of Automata and Formal Languages Subject Code: KCA- 201
Duration: 3 Hrs Max. Marks: 100
Note: Attempt all the questions of each section
Section-A (210=20)
Q. 1 Competitive BL/
Exam# CO
KC*
a Differentiate between mean alphabets and strings in Automata? 1 2/C
b Let S and T be language over ={a,b} represented by the regular expressions
GATE
(a+b*)* and (a+b)*, respectively. Determine whether S and T are equal or 1 3C/P
2000
not.
c Write regular expressions describes the language over {0, 1} consisting of GATE 3C/P
2
strings that contain exactly two 1's? 2008
d Determine the regular expressions represents the language: the set of all binary 3C/P
2
strings having two 0s.
e Let L denotes the language generated by the grammar S -> 0S0/00. Examine is GATE 2C
3
it regular or not? 2000
f Discuss production rule for CNF. 3 2C
g Discuss pumping lemma for CFL. 4 2C
h Discuss are benefits of PDA over DFA? 4 2C
i Explain features of Multi head Turing machine. 5 2C
j Explain Church-Turing Thesis 5 2C
Section-B (65=30)
Draw a DFA for accepting the language over the alphabets {0,1}. The set of
strings must have three consecutive zeros.
Q. 2 OR 1 3C/P
Draw a finite state machine for binary adder.

Show that the given language L = {an bn cn | n ≥ 0} is regular or not.


OR
Discover the regular expression for ∑ = {a,b} that generates the sets of all
Q. 3 strings with 2 3C/P
a) Starting with a and ending with b
b) Starting and ending with different characters.
c) Not containing aab as sub string.
Investigate the string "aabbabba" for leftmost derivation and rightmost
derivation using a CFG given by,
1. S → aB | bA  
2. A → a | aS | bAA  
3. B → b | bS | aBB  
Q. 4 3 3C/P
And also construct a derivation tree.

OR
Express the grammar in terms formal definition. Also discover the CFG for odd
length palindrome.
Briefly explain the closure properties of CFL.
Q. 5 OR 4 2C/P
Differentiate 2 Stack PDA with Single Stack PDA with suitable example.
Q. 6 5 2C/P

 CO -Course Outcome generally refer to traits, knowledge, skill set that a student attains after completing the course successfully.
 Bloom’s Level (BL) - Bloom’s taxonomy framework is planning and designing of assessment of student’s learning.
 *Knowledge Categories (KCs): F-Factual, C-Conceptual, P-Procedural, M-Metacognitive
 #Reference to Competitive Exams (GATE, GPAT, CAT, GRE, TOFEL, NET, etc. )
Roll No. ___________________
Write short note on:
(i) Post correspondence problem
(ii) ID in Turing Machine
OR
Define Turing machine and its variants with suitable examples.
Section-C (105=50)
Illustrate the steps of DFA minimization and also minimize the DFA
shown below.

Q. 7 1 3C/P

OR
Design a Moore machine that will print output 1 for every occurrence of
abb otherwise 0. Later, convert Moore Machine into Mealy Machine.
Draw a NFA with epsilon for the given regular expression 1*(0 + 11)
0*.
OR
State Arden’s theorem and express the regular expression for the
following transition diagram using Arden’s Theorem

Q. 8 2 3C/P

Explore the steps to Convert a CFG into Greibach Normal Form. Modify the
given CFG to GNF with productions
S → AA | 0
A → SS | 1
OR
Q. 9
Explore the steps to Convert a CFG into Chomsky Normal Form. Modify the 3 3C/P
given CFG to CNF with productions
S->a|aA|B|C
A->aB | ε
B-> Aa
C-> cCD
D->DD
Q. 10 Transform a deterministic string into PDA.
OR 4 4 C/P
Transform a non-deterministic string into PDA.
Q. 11 Transform a lower-case string into upper case using TM. 5 4 C/P
OR
Explore the following using a short note on
a) Halting problem
 CO -Course Outcome generally refer to traits, knowledge, skill set that a student attains after completing the course successfully.
 Bloom’s Level (BL) - Bloom’s taxonomy framework is planning and designing of assessment of student’s learning.
 *Knowledge Categories (KCs): F-Factual, C-Conceptual, P-Procedural, M-Metacognitive
 #Reference to Competitive Exams (GATE, GPAT, CAT, GRE, TOFEL, NET, etc. )
Roll No. ___________________
b) Universal TM

 CO -Course Outcome generally refer to traits, knowledge, skill set that a student attains after completing the course successfully.
 Bloom’s Level (BL) - Bloom’s taxonomy framework is planning and designing of assessment of student’s learning.
 *Knowledge Categories (KCs): F-Factual, C-Conceptual, P-Procedural, M-Metacognitive
 #Reference to Competitive Exams (GATE, GPAT, CAT, GRE, TOFEL, NET, etc. )

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