NAME OF PROGRAMME: B.

TECH (CSE)
SEMESTER / YEAR:4TH / 2ND
SUBJECT NAME (SUBJECT CODE): ETCS-241
SECTION-A (Very Short Answer Type Questions)
CO1 : Remember ,CO2 : Understand, CO3 : Apply, CO4 : Analyses, CO5 : Evaluate

UNIT-I
S.No. Question COURSE
OUTCOMES
a) Define CO1
(a) Finite Automata (FA)
(b) Transition Diagram
b) Construct a DFA for the language over {0, 1}* such that it contains “000” as a substring.? CO1
c) State the difference between NFA and DFA? CO2
d) Construct deterministic finite automata to recognize odd number of 1’s and even number of 0’s? CO2
e) What are the applications of automata theory CO3
f) What are the components of Finite automaton model? CO3
g) What is Є-closure of a state q0? CO4
h) What is a : (a) String (b) Regular language CO4
i) What is a regular expression? CO5
j) Differentiate L* and L+ CO5
UNIT-II
S.No. Question COURSE
OUTCOMES
a) State Myhill-Nerode Theorem. CO1
b) State the pumping lemma theorem for regular languages. CO1
c) State giving example the condition when two finite automata are said to be CO2
equivalent.
d) Define Two-way finite automata. CO2
e) Give the meaning of terms Homomorphism and Inverse Homomorphism in CO3
terms of
regular languages.
f) Prove pumping lemma? CO3
g) Prove that L={w|w is a palindrome on {a,b}*} is not regular. i.e., L={aabaa, aba, abbbba,…} CO4
h) Write short note on Applications of Regular Expressions? CO4
i) Obtain a DFA to accept strings of a’s and b’s starting with the string ab? CO5
j) Explain Closure properties with an example. CO5
UNIT-III
S.No. Question COURSE
OUTCOMES
a) Giving an example define the term Instantaneous Description. CO1
b) State one point difference between acceptance by final state and empty stack. CO1
c) Define ambiguity. CO2
d) State one point difference between right most derivation and left most CO2
derivation tree.
e) Differentiate between ambiguous and unambiguous grammar. CO3
f) Explain CGF with an example. . CO3
g) Explain decision properties of regular language. CO4
h) Eliminate non-reachable symbols from S -> aS | A, A -> a, B -> aa CO4
i) Show that L = {ww |w {0, 1}*} is not CFL. CO5
j) Show that deviation for the string aab is ambiguous? CO5
 S-> AB/aaB
A->a/Aa
B->b
UNIT-IV
S.No. Question COURSE
OUTCOMES
a) Show that deviation for the string aabaab is accepted by production rule CO1
S-> AB/aaB
A->a/Aa
B->b
b) Show that deviation for the string aaaab is ambiguous CO1
S-> AB/aaB
A->a/Aa
B->b
c) State Pumping Lemma for CFL. Why is it used? Give an example of it CO2
application.
d) What is a Regular Set? State whether the language L= { no. of are odd } is are CO2
regular language. Justify your answer.
e) By giving an example in each case explain the following closure properties of CO3
CFLs: Union, Concatenation, Reversal and Kleen Closure.
f) Design a PDA to accept the set of all strings of 0’s and 1’s such that no prefix has more 1’s than CO3
0’s.
g) How do you convert From PDA to CFG? CO4
h) Convert to PDA, CFG with productions A o aAA, A -> aS | bS | a S -> SS | (S) | H S -> aAS | CO4
bAB | aB, A -> bBB | aS | a, B -> bA | a
i) Give leftmost and rightmost derivations of the following strings a) 00101 b) 1001 c) 00011 CO5
S-> ABA
A->1
B->0
j) Construct DPDA which accepts the language L = {wcwR | w {a, b}*, c Σ}. CO5
UNIT-V
S.No. Question COURSE
OUTCOMES
a) Define Chomsky Hierarchy. CO1
b) Define Recursively Enumerable language with an example. CO1
c) State the meaning of Context Sensitive language. CO2
d) What do you understand by non-deterministic turing machine. CO2
e) State the concept of un decidability of PCP. CO3
f) Design a Turing machine to accept a Palindrome? CO3
g) Define undesirability, decidability? CO4
h) Explain Programming techniques for Turning Machine? CO4
i) Design a TM to recognize a string of the form a n b 2 n CO5
j) What are the required fields of an ID or configuration of a TM. CO5
SECTION-B (Short Answer Type Questions)
UNIT-I
S.No. Question COURSE
OUTCOMES
a) State the relations among regular expression, deterministic finite automata, non deterministic CO1
finite automaton and finite automaton with epsilon transition?
b) Describe the language accepted by the following finite automation: CO1

State Input Symbol

a b
→P Q R
 *Q R P
R R R
c) For the regular expression prove that, (a+b)* is not equal to a* + b*. CO2
d) Construct a DFA accepting all strings over alphabet set {0, 1}. CO2
e) State the condition in which two machines M1 and M2 are said to be CO3
equivalent. Show that
the
following
two finite
automations are not equivalent:

f) Design a FA which accepts set of strings containing exactly four 1& three 0’s in CO3
every string over { 0, 1 }.
g) Convert the following NFA to DFA and describe the language it accepts. (* + * + * +) and δ is CO4
given as: p=start state, R =final state
0 1
P {P,Q} {P}
Q {R,S} {T}
R {P,R} {T}
S - -
T - -
h) Define nondeterministic finite automata(NFA). Draw the NFA for the language CO4

L={an bm| n, m>=1}

i) CO5

Convert the following NFA to DFA.

j) Write regular expression for the language L={1n 0m|n>=1, m>=0} CO5

UNIT-II
S.No Question COURSE
. OUTCOME
S
a) State the closure properties of regular languages. CO1
b) State giving example the concept of equivalence of two DFA. CO1
c) Prove that the complement of a regular language is closed. CO2
d) What do you understand by the term minimization of a DFA? CO2
e) CO3

Construct a minimum state automation equivalent to the finite automation given

below:
f) Write the notation for the language defined by a DFA. Write a string belong to CO3
the language L3 if L={0,1}
g) Minimize the following DFA. CO4

δ a b
P0 P0 P1
P1 P2 P1
P2 P3 P1
*P3 P3 P4
*P4 P5 P4
h) Verify that the following languages is not regular: CO4

{anb2n | n>0 }
i) Prove that “ A language L is accepted by some ε-NFA if and only if L is accepted CO5
by some NFA”
j) Convert the following ε-NFA to NFA CO5

ε 1 2 3
q0 ᴓ { q0} { q1} { q2}
q1 { q0} { q1} { q2} ᴓ
q2 { q1} { q2} ᴓ { q0}
UNIT-III
S.No. Question COURSE
OUTCOMES
a) Define a Context Free Grammar(CFG). Construct a CFG for the language CO1

b) Prove that every regular language is a CFL. CO1

c) Define the term sentential form of a grammar. State the difference between a CO2
context free and context sensitive language.

d) Check whether the grammar is ambiguous or not. CO2

 R-> R+R/ RR/ R*/ a / b / c. Obtain the string w = a+b*c
e) Construct a PDA that accepts the language L = { wcwR | w = (a+b)* }. CO3
f) Define context free grammar. Consider the following CFG CO3
S → aSa     rule 1  
S → bSb     rule 2  
S → c       rule 3  
Prove by induction on the string length that no string in L(G) has as
substring.
g) Design a PDA to accept the set of strings with twice as many 0’s as 1’s. CO4
h) Find a CFG without ε-productions equivalent to the grammar defined by CO4
S → ABaC, A→BC, B→b/ ε, C→D/ ε , D→d
i) Design a PDA to accept the language {02n1 CO5
n
| n ≥ 1}.
j) What is unambiguity? CO5
UNIT-IV
S.No. Question COURSE
OUTCOMES
a) Define the term Deterministic PDA. What are useless symbols in a Context CO1
Free Language(CFL)? State giving example the concept of reduction a
grammar.

b) Convert the following grammar into CNF: CO1

S--> aB | bA
A--> aS | a | bAA
B--> bS | b | aBB

c) Write a short note on the term instantaneous description of a PDA. Give an CO2
example.
d) What is the difference between acceptance of a string a stack by final state and CO2
empty stack (or null store). Give an example.

e) Define the term Context Free Language(CFL). Find out whether the language CO3
L = {xnynzn | n ≥ 1} is context free or not.

f) (i) What is the purpose of normalization? CO3

Construct the CNF and GNF for the following grammar and explain the steps.
S→aAa | bBb |€
A→C|a
B→C|b
C→CDE | €
D→A|B|ab
(ii) Constuct a CFG for the regular expression (ab+b)(ab).
g) State Pumping lemma for CFLs. Write the applications of pumping lemma for CO4
CFL s.
h) Check whether L={aibici| i > 0} belong to CFL or not. CO4
i) Define a deterministic PDA. How a DPDA differs from a non-deterministic CO5
PDA?
j) Design a PDA to accept the language {02n1n| n ≥ 1}. CO5

b) Find a CFG without ε-productions equivalent to the grammar defined by

S → ABaC, A→BC, B→b/ ε, C→D/ ε , D→d
UNIT-V
S.No. Question COURSE
OUTCOMES
a) State Post's Correspondence Problem. Does the PCP with the two lists X=(10, CO1
011, 101), Y=(101, 11, 011) have a solution?

b) Design a Turing machine to recognize all strings having an odd number of 1's CO1
over {0,1}.

c) Write a short note on the Variants of Turing machine. CO2

d) Design a turing machine to compute f(m,n) = m + n. CO2

e) Consider the Post correspondence system described by the following lists CO3
X = (10, 01, 0, 100, 1) and Y = (101, 100, 10, 0, 010). Does this PCP have a
solution?

f) Find the Greibach normal form grammar equivalent to the following CFG: CO3
S → AB
A → BS| 1
B → SA|0
g) Discuss about Multitape Turing Machines. Explain informally how they can CO4
simulate the moves of a Turing Machine
h) Design the Turing machine to recognize the language: {0n1n0n| n>=1}. CO4
i) How to identify deterministic Turing machine from nondeterministic TM CO5
j) Design a Turing machine to identify the strings belong to the language L={0n1n| CO5
n>0}.

SECTION-C [Descriptive Answer Type Questions / Case Study (for MBA COURSES only)]
UNIT-I
S.No. Question COURSE
OUTCOMES
a) State the differences between NFA and DFA. For the given NFA CO1
construct an equivalent DFA q0=start state, q3=final state
Next State
Present State
0 1

q0 q3 q1

q1 q2 q1,q2
 q2 q3 q0

q3 null q0

b) Define the term finite automata. With the help of an example explain the CO1
different simplified notations used for representing a finite automation.
c) What is a regular expression? Giving an example, construct a DFA for a regular CO2
expression?
d) Construct NFA without ε – transitions from the following NFA. M=({q0, CO2
q1,q2}, {a, b, c}, δ , q0, {q2}) and δ(q0 , a) = {q0}, δ(q0 , b) = {q1}, δ(q0 , c) =
{q2}
δ(q1 , ε) = {q0}, δ(q1 , a) = {q1}, δ(q1 , b) = {q2},
δ(q2 , ε) = {q1}, δ(q2 , a) = {q2}, δ(q2 , c) = {q0}.
e) Differentiate between the transition function in DFA, NFA and ε-NFA? CO3
f) Construct a CFG for the language L = anb2n where n>=1. CO3
g) Compare the transition functions of NFA and DFA. CO4
h) Draw a six state DFA which can be minimized to a three state DFA where set of CO4
input symbols is {a, b, c}. Draw both the DFAs. Assume whatever is required.
i) Show that L={0p/ p is a prime number} is not regular. CO5

b) Construct the CFG for the union of the languages 0n1n and anbn for n>0.
j) CO5

Convert the given NFA to DFA.

UNIT-II
S.No. Question COURSE
OUTCOMES
a) Define Mealy machine and Moore machine. Design a Mealy machine that CO1
scans binary strings over {0,1}, and produces output X for each occurrence of
substring 101, produces output Y for each occurrence of substring 110,
otherwise produces output Z.

b) a) State pumping lemma. Why is it used? CO1

c) a) State Arden's theorem. Find the regular expression using Arden's CO2
theorem of FA given below:
d) a)Prove the equivalence of NFA and DFA. CO2
b) What is Myhill Nerode Theorem?
e) What is a Moore machine? How is it different from mealy machine? CO3
f) Differentiate Moore machine from Mealy machine. Write the tuple representation for both CO3
machines.
g) Give a CFG for the language N(M) where M = ({p,q,r}, {0, 1}, {Z, X0}, δ, q0, Z, r) and δ is CO4
given by δ(p , ϵ , X0) = {(q, ZX0)}, δ(q , ϵ , X0) = {(r, ϵ)}, δ(q , 1, Z) = {(q, ZZ)}, δ(q , 0, Z) =
{(q, ϵ)}
h) Design an ϵ-NFA for the regular expression (0+1)*01 CO4
i) Which of the following operations are closed under regular sets. Justify your CO5
answer.
i) Complementation ii) Set difference iii) string reversal iv) Intersection
j) Find a CFG without ε-productions equivalent to the grammar defined by CO5
S → ABaC, A→BC, B→b/ ε, C→D/ ε , D→d
UNIT-III
S.No. Question COURSE
OUTCOMES
a) In context to a CFG, define the terms parse tree, leftmost derivation and CO1
rightmost derivation and ambiguity. Show that the CFG with productions
S--> a | Sa | bSS | SSb | SbS is ambiguous.
b) Consider the grammar with the production S->aSS A->b. Compute the string CO1
aababbb with the left most and right most derivation. Draw the derivation tree.

c) Design a PDA to accept the language {02n1n| n ≥ 1}. CO2

d) What is the difference between NPDA and DPDA? CO2
e) Construct the PDA for the language {0n1n}*. CO3
f) Give the formal definition of an NPDA. CO3
b) Show that NPDA and CFG are equivalent.
g) Is the language ww r where w is string of zeroes and ones, accepted by DPDA? CO4
Why?
h) Write the conditions for a pushdown automaton to be considered as deterministic? CO4
i) Which are the methods to accept a string in a PDA? Whether both type of PDAs can define the CO5
same language. Justify your answer?
j) Design a PDA to accept the language {02n1 n | n ≥ 1}? CO5
UNIT-IV
S.No. Question COURSE
OUTCOMES
a) What are the various normal forms of a CFG. State giving example. Convert CO1
the given CFG into GNF:
S--> AA | 0
A--> SS | 1
b) Convert the following CFG into PDA CO1
S--> aSa | aA | Bb
A --> aA | a
B --> Bb | A

c) CO2

d) State Pumping lemma for CFLs. Write the applications of pumping lemma for CFL s. CO2
e) Check whether L={a i b i c i | i > 0} belong to CFL or no? CO3
f) Write the properties of recursive languages and recursively enumerable languages. CO3
g) Whether the following grammar is ambiguous? CO4

E-> E+E| E*E|I

I-> 0|1|a|b
h) Find the Greibach normal form grammar equivalent to the following CFG: CO4
S → AB
A → BS| 1
B → SA|0
i) Is NPDA (Nondeterministic PDA) and DPDA (Deterministic PDA) equivalent? Illustrate with CO5
an example.
j) State pumping lemma for CFL? CO5
UNIT-V
S.No. Question COURSE
OUTCOMES
a) Define a Turing machine and also give its model diagram. Draw the transition CO1
diagram for a turing machine accepting the language L= { w2w | w in {a, b}*
}.

b) Write short notes on the following: CO1

(i) Halting problem (ii) Universal Turing Machine
c) Define the recursive language. Do you agree that every recursive language is CO2
recursively enumerable? Justify your answer.

d) What is chomsky normal form? CO2

e) Design a TM that accepts the language of odd integers written in binary. CO3
f) Construct a Turing machine to compute ‘n mod 2’ where n is represented in the tape in unary CO3
form consisting of only 0’s.
g) How to identify deterministic Turing machine from nondeterministic TM CO4
b) Write notes on the following:
i) decidable and undecidable problems
ii) Halting Problem of Turing machine.
h) Design a Turing machine to identify the strings belong to the language L={0n1n| CO4
 n>0}.
i) Are there any languages which are not recursively enumerable, but accepted by CO5
a multi-tape Turing machine? Justify your answer.
j) List the closure properties of Recursive Languages CO5
b) Define a Universal Turing Machine (UTM). With the help of suitable
arguments show the simulation of other Turing machines by a UTM.