Scribd
Upload
139 views

Btech Cs 4 Sem Theory of Automata and Formal Languages Ecs403 2019

This document contains the questions from a theory examination on Automata and Formal Languages. It is divided into 7 sections with multiple choice and long answer questions. The topics covered include regular expressions, finite automata, pushdown automata, context-free grammars, Turing machines, and properties of formal languages such as closure properties and pumping lemma. Students are asked to design automata and grammars, prove language properties, perform derivations, and describe machine models.

Uploaded by

Sp
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
139 views

Btech Cs 4 Sem Theory of Automata and Formal Languages Ecs403 2019

This document contains the questions from a theory examination on Automata and Formal Languages. It is divided into 7 sections with multiple choice and long answer questions. The topics covered include regular expressions, finite automata, pushdown automata, context-free grammars, Turing machines, and properties of formal languages such as closure properties and pumping lemma. Students are asked to design automata and grammars, prove language properties, perform derivations, and describe machine models.

Uploaded by

Sp
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

ECS403

Printed Pages: 02 Sub Code: ECS403


Paper Id: 110218 Roll No.

B. TECH.
(SEM IV) THEORY EXAMINATION 2018-19
THEORY OF AUTOMATA & FORMAL LANGUAGES
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A

1. Attempt all questions in brief. 2 x 10 = 20


a. Write a regular expression to denote a language L which accepts all the strings
that begin or end with either 00 or 11.
b. Differentiate between FA and PDA.
c. Write the applications of finite automata.
d. How do we determine equivalence of two DFA? Explain with an example.
e. Remove the Unit productions from the following grammar:
S → aSb|A, A → cAd|cd
f. Identify the language generated by context free grammar S → (S)|SS|( )
g. Explain briefly about two stack PDA.
www.aktuonline.com

h. Distinguish between DPDA & NPDA.


i. Differentiate between Recursive & Recursive enumerable languages.
j. Define halting problem of Turing machine.
SECTION B

2. Attempt any three of the following: 10 x 3 = 30


a. Design FA for the following languages containing binary strings:
(i) Having both 00 and 11 as substring.
(ii) Number of 0’s is odd and number of 1’s is multiple of 3.
b. State closure properties of regular languages. Also Prove that regular languages
are closed under intersection and difference.
c. Convert the following PDA into its equivalent CFG.
Transition function is defined as:
δ (q0 , 0, Z 0 ) = {(q0 , 0Z 0 )}
δ (q0 , 0, 0) = {(q0 , 00)}
δ (q0 ,1, 0) = {(q1 ,∈)}
δ (q1 ,1, 0) = {(q1 ,∈)}
δ (q1 ,∈, Z 0 ) = {(q2 ,∈ )}
d. Write the procedure to convert a given CFG into equivalent grammar in CNF.
Apply the procedure and convert the grammar with following production into
CNF: S → bA|aB, A → bAA|aS|a, B → aBB|bS|b
e. Design a Turing machine that accepts Palindromes of binary numbers.

Page 1 of 2

http://www.aktuonline.com
ECS403

SECTION C
3. Attempt any one part of the following: 10 x 1 = 10
(a) Describe Chomsky hierarchy of languages with proper example.
(b) Design an NFA for the language containing strings ending with ab or ba. Also
convert the obtained NFA into equivalent DFA.

4. Attempt any one part of the following: 10 x 1 = 10


(a) State Arden’s theorem and construct regular expression for the following FA
using Arden’s theorem:
State Input
0 1
A {A, B} φ
B C {A, B}
C B φ
A is the initial state and C is Final State

(b)
{ 2

}
Using pumping lemma, prove that the language L = a i | i ≥ 1 is not regular.

5. Attempt any one part of the following: 10 x 1 = 10


www.aktuonline.com

(a) Define Greibach normal form for a CFG. Reduce the following CFG into GNF:
S → AB, A → BS | a, B → SA | b
(b) Let G be the grammar S → 0B|1A, A → 0|0S|1AA, B → 1|1S|0BB
For the string 00110101, find:
(i) The leftmost derivation. (ii) The rightmost derivation. (iii) The derivation
tree.

6. Attempt any one part of the following: 10 x 1 = 10


(a) Construct a PDA to accept the language L = {WcW R | W ∈ (a, b) + } by empty
stack.
(b) Prove that “L is accepted by a PDA M1 by empty store if and only if L is
accepted by a PDA M2 by final state.

7. Attempt any one part of the following: 10 x 1 = 10


(a) Find a PCP solution for the following sets A = {ab, ba, b, abb, a}, B= {aba,
abb, ab, b, bab}

(b) Explain various types of Turing Machines with example.

Page 2 of 2

http://www.aktuonline.com

You might also like