Scribd
Upload
376 views3 pages

19ecs303 - Formal Languages and Automata Theory

This document is a past exam paper for a formal languages and automata theory course. It contains 11 short answer and long answer questions across 5 units on topics like finite automata, non-deterministic finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and more. Students have 3 hours to complete the exam worth a total of 60 marks.

Uploaded by

Nishanth Nuthi
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
376 views3 pages

19ecs303 - Formal Languages and Automata Theory

This document is a past exam paper for a formal languages and automata theory course. It contains 11 short answer and long answer questions across 5 units on topics like finite automata, non-deterministic finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and more. Students have 3 hours to complete the exam worth a total of 60 marks.

Uploaded by

Nishanth Nuthi
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/ 3

[Nov-22]

GITAM (Deemed to be University)


[19ECS303]
B.Tech. Degree Examination
Computer Science & Engineering
V Semester
FORMAL LANGUAGES AND AUTOMATA THEORY
(Effective from the admitted batch 2020–21)
Time: 3 Hours Max.Marks: 60
---------------------------------------------------------------------------------------------------
Instructions: All parts of the unit must be answered in one place only.
Figures in the right hand margin indicate marks allotted.
---------------------------------------------------------------------------------------------------
Section-A
1. Answer all Questions: (102=20)
a) Define Finite Automata & list the applications of FA
b) Give the transition table for the following finite automata.

c) List out the closure properties of regular language.


d) State the pumping lemma conditions.
e) What is ambiguity in CFG?
f) When will you say that Grammar is Left Recursive? How to
eliminate Left recursion?
g) Define PDA.
h) Mention the properties of CFL.
i) Define Linear Bounded Automaton.

Page 1 of 3
j) Define a Universal Turing Machine.

Section-B
Answer the following: (58=40)
UNIT-I
2. a) Design a DFA over ∑= {0, 1} for the language, L= {w | w contains
the sub-string “01"}. 4M
b) Differentiate between DFA and NFA. 4M
OR
3. Convert the given є- NFA to NFA without epsilon moves.

UNIT-II
4.

Page 2 of 3
Consider the given two machines M1 and M2, answer the following
questions.
a) Give the acceptance states.
b) Write the sequence of states for the string ‘aabba’.
c) Does the machines accepts the string ‘aabb’. Justify your answer.
d) Does the machines accepts ε.
OR
5. Find at least four strings of minimal length over ∑={0, 1}, that is not in
the language corresponding to the given regular expression:
10*+(0+11)0*1*.

UNIT-III
6. a) Write a short notes on Chomsky Hierarchy. 4M
b) Write the grammar which accepts even length palindromes over
Ʃ = {0,1}. Construct the parse tree for the string ‘110011’. 4M
OR
7. Is the language L ={anbncn|n>=0} a CFL or not? Justify your answer.
UNIT-IV
8. Construct the PDA which accept L={anb2n | n>=0}.
OR
9. Construct the PDA for accepting palindrome.
UNIT-V
10. Design Turing Machine for the language L= {0n1n2n | n>=1}.
OR
11. Write a short note on Universal Turing Machine.

[8/V S/122]

Page 3 of 3

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