Scribd
Upload
90 views3 pages

WWW - Manaresults.Co - In: B) Minimize The Following Dfa. (Figure 2) (5+5)

This document is an exam paper for a course on Formal Languages and Automata Theory. It contains 10 questions testing various concepts related to formal languages, automata, and computability. The exam is divided into two parts - Part A contains 10 short answer questions worth 25 marks total, and Part B contains 5 longer questions each worth 10 marks that may have multiple sub-questions. Topics covered include non-deterministic finite automata (NFA), deterministic finite automata (DFA), regular expressions, grammars, pushdown automata (PDA), Turing machines, and computability concepts like recursive and recursively enumerable languages.

Uploaded by

Manaswi Minnu
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
90 views3 pages

WWW - Manaresults.Co - In: B) Minimize The Following Dfa. (Figure 2) (5+5)

This document is an exam paper for a course on Formal Languages and Automata Theory. It contains 10 questions testing various concepts related to formal languages, automata, and computability. The exam is divided into two parts - Part A contains 10 short answer questions worth 25 marks total, and Part B contains 5 longer questions each worth 10 marks that may have multiple sub-questions. Topics covered include non-deterministic finite automata (NFA), deterministic finite automata (DFA), regular expressions, grammars, pushdown automata (PDA), Turing machines, and computability concepts like recursive and recursively enumerable languages.

Uploaded by

Manaswi Minnu
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

Code No: 114AG R13

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD


B.Tech II Year II Semester Examinations, October/November - 2016
FORMAL LANGUAGES AND AUTOMATA THEORY
(Computer Science and Engineering)
Time: 3 Hours Max. Marks: 75

Note: This question paper contains two parts A and B.


Part A is compulsory which carries 25 marks. Answer all questions in Part A.
Part B consists of 5 Units. Answer any one full question from each unit.
Each question carries 10 marks and may have a, b, c as sub questions.

PART - A (25 Marks)


1.a) Define δ in NFA with ε  (Epsilon) moves. [2]
b) Design FA to accept set of all strings over {0,1} containing 4 consecutive zeros.
[3]
c) Define Right Linear Grammar. [2]
d) Define Regular Expression. [3]
e) Define Ambiguous Grammar. [2]
f) When will you say that Grammar is Left Recursive? How to eliminate Left
recursion? [3]
g) Define Context sensitive Grammar. [2]
h) Define Linear Bounded Automaton. [3]
i) Give any two examples of Decidable Problems. [2]
j) Give any three examples of recursive languages. [3]

PART - B (50 Marks)


2.a) Convert the following NFA with € moves to DFA.(Figure 1)

Figure 1
b) Minimize the following DFA. (Figure 2) [5+5]

Figure 2
www.ManaResults.co.in
OR
3.a) Let L1 = {010}, L2={01,0} then find
(i) L1L2 (ii)L1* (iii)L2+ (iv) L1* + L2*
b) Verify the following two FA’s are equivalent or not? (Figure 3 and Figure 4) [6+4]
FA1:

Figure 3
FA2:

Figure 4

4.a) Construct Finite Automata for the regular expression 0*1*(101)*11.


b) Obtain the finite automata for the grammar G=({A,B},{0,1},P,A) Where P is given
as A-> 0A | 1B | 1, B-> 0B | 0 . [5+5]
OR
5.a) Write about closure properties of regular sets.
b) Convert the following Finite Automata to it’s equivalent Regular Expression.
(Figure 5) [5+5]

Figure 5

6.a) Construct CFG for the PDA given below A=({q0,q1},{0,1},{S,A},δ,q0,S,φ) where
δ  is given as below
δ (q0,1,S)={(q0,AS)}
δ (q0,ε,S)={(q0,ε)}
δ (q0,1,A)={(q0,AA)}
δ (q0,0,A)={(q1,A)}
δ (q0,1,A)={(q1,ε)}
δ (q1,0,S)={(q0,S)}
b) Construct PDA for the language L={ anbn / n>=1} [5+5]
OR
7.a) Construct PDA for the language L={WWr /where W Є(a+b)*, Wr is reverse of W}.
b) Construct PDA for the given CFG: SÆaSb, SÆab, Where S is the only variable and
{a,b} are terminals. [5+5]
www.ManaResults.co.in
8.a) Construct the Turning machine for the language L={ anbncn | n>=1}.
b) Define Linear Bounded automata with a suitable example? [6+4]
OR
9.a) Construct the Turning machine for the language L={ anb2n| n>=1}.
b) Write properties of recursive and recursively enumerable languages. [6+4]

10.a) Explain Chomsky’s hierarchy of languages?


b) What is post correspondence problem? Verify whether the following PCP has solution
or not? A={ba,ab,a,baa,b}, B={ bab,baa,ba,a,aba } [5+5]
OR
11. Define the following and give examples
a) P – type problem
b) NP – Hard problem [5+5]

www.ManaResults.co.in

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