JEPPIAAR ENGINEERING COLLEGE

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

CS6503
THEORY OF COMPUTATION

Question Bank

III YEAR A & B / BATCH : 2016 -20

Vision of Institution
To build Jeppiaar Engineering College as an Institution of Academic Excellence in Technical
education and Management education and to become a World Class University.
Mission of Institution

M1 To excel in teaching and learning, research and innovation by promoting the

principles of scientific analysis and creative thinking

To participate in the production, development and dissemination of knowledge and

M2
interact with national and international communities

To equip students with values, ethics and life skills needed to enrich their lives and
M3
enable them to meaningfully contribute to the progress of society

M4 To prepare students for higher studies and lifelong learning, enrich them with the
practical and entrepreneurial skills necessary to excel as future professionals and
contribute to Nation’s economy

Program Outcomes (POs)

Engineering knowledge: Apply the knowledge of mathematics, science, engineering
PO1 fundamentals, and an engineering specialization to the solution of complex engineering
problems.
Problem analysis: Identify, formulate, review research literature, and analyze complex
PO2 engineering problems reaching substantiated conclusions using first principles of
mathematics, natural sciences, and engineering sciences.
Design/development of solutions: Design solutions for complex engineering problems
and design system components or processes that meet the specified needs with
PO3 appropriate consideration for the public health and safety, and the cultural, societal, and
environmental considerations
Conduct investigations of complex problems: Use research-based knowledge and
PO4 research methods including design of experiments, analysis and interpretation of data,
and synthesis of the information to provide valid conclusions.
Modern tool usage: Create, select, and apply appropriate techniques, resources, and
PO5 modern engineering and IT tools including prediction and modeling to complex
engineering activities with an understanding of the limitations.
The engineer and society: Apply reasoning informed by the contextual knowledge to
PO6 assess societal, health, safety, legal and cultural issues and the consequent responsibilities
relevant to the professional engineering practice.
Environment and sustainability: Understand the impact of the professional engineering
PO7 solutions in societal and environmental contexts, and demonstrate the knowledge of, and
need for sustainable development.
Ethics: Apply ethical principles and commit to professional ethics and responsibilities
PO8 and norms of the engineering practice.
 Individual and team work: Function effectively as an individual, and as a member or
PO9 leader in diverse teams, and in multidisciplinary settings.
Communication: Communicate effectively on complex engineering activities with the
engineering community and with society at large, such as, being able to comprehend and
PO10 write effective reports and design documentation, make effective presentations, and give
and receive clear instructions.
Project management and finance: Demonstrate knowledge and understanding of the
PO11 engineering and management principles and apply these to one’s own work, as a member
and leader in a team, to manage projects and in multidisciplinary environments.
Life-long learning: Recognize the need for, and have the preparation and ability to
PO12 engage in independent and life-long learning in the broadest context of technological
change.

Vision of Department
To emerge as a globally prominent department, developing ethical computer professionals,
innovators and entrepreneurs with academic excellence through quality education and research.
Mission of Department

To create computer professionals with an ability to identify and formulate the

M1
engineering problems and also to provide innovative solutions through effective
teaching learning process.

M2 To strengthen the core-competence in computer science and engineering and to create

an ability to interact effectively with industries.

M3 To produce engineers with good professional skills, ethical values and life skills for the
betterment of the society.

M4 To encourage students towards continuous and higher level learning on technological

advancements and provide a platform for employment and self-employment.

Program Educational Objectives (PEOs)

PEO1 To address the real time complex engineering problems using innovative approach
with strong core computing skills.

PEO2 To apply core-analytical knowledge and appropriate techniques and provide

solutions to real time challenges of national and global society

PEO3 Apply ethical knowledge for professional excellence and leadership for the
betterment of the society.

PEO4 Develop life-long learning skills needed for better employment and
entrepreneurship
Program Specific Outcomes (PSOs)

Students will be able to

An ability to understand the core concepts of computer science and engineering and to
PSO1 enrich problem solving skills to analyze, design and implement software and hardware
based systems of varying complexity.

To interpret real-time problems with analytical skills and to arrive at cost effective and
PSO2 optimal solution using advanced tools and techniques.

An understanding of social awareness and professional ethics with practical proficiency in

the broad area of programming concepts by lifelong learning to inculcate employment and
PSO3
entrepreneurship skills.

BLOOM TAXANOMY LEVELS(BTL)

BTL6: Creating.,
BTL 5: Evaluating.,
BTL 4: Analyzing.,
BTL 3: Applying.,
BTL 2: Understanding.,
BTL 1: Remembering
 SYLLABUS

THEORY OF COMPUTATION – CS6503 (V SEMESTER)

UNIT I FINITE AUTOMATA

Introduction- Basic Mathematical Notation and techniques- Finite State systems – Basic
Definitions –Finite Automaton – DFA & NDFA – Finite Automaton with €- moves – Regular
Languages- Regular Expression – Equivalence of NFA and DFA – Equivalence of NDFA’s with
and without €-moves –Equivalence of finite Automaton and regular expressions –Minimization
of DFA- - Pumping Lemma for Regular sets – Problems based on Pumping Lemma.
UNIT II GRAMMARS
Grammar Introduction– Types of Grammar - Context Free Grammars and Languages–
Derivations and Languages – Ambiguity- Relationship between derivation and derivation trees –
Simplification of CFG – Elimination of Useless symbols - Unit productions - Null productions –
Greiback Normal form – Chomsky normal form – Problems related to CNF and GNF.
UNIT III PUSHDOWN AUTOMATA
Pushdown Automata- Definitions – Moves – Instantaneous descriptions – Deterministic
pushdown automata – Equivalence of Pushdown automata and CFL - pumping lemma for CFL –
problems based on pumping Lemma.
UNIT IV TURING MACHINES
Definitions of Turing machines – Models – Computable languages and functions –Techniques
for Turing machine construction – Multi head and Multi tape Turing Machines - The Halting
problem –Partial Solvability – Problems about Turing machine- Chomskian hierarchy of
languages.
UNIT V UNSOLVABLE PROBLEMS AND COMPUTABLE FUNCTIONS

Unsolvable Problems and Computable Functions – Primitive recursive functions – Recursive

and recursively enumerable languages – Universal Turing machine. MEASURING AND
CLASSIFYING COMPLEXITY: Tractable and Intractable problems- Tractable and possibly
intractable problems - P and NP completeness - Polynomial time reductions.

Total= 45 Periods
TEXT BOOKS:

1. Hopcroft J.E., Motwani R. and Ullman J.D, “Introduction to Automata

Theory, Languages and Computations”, Second Edition, Pearson Education,
2008. (UNIT 1,2,3)
2. John C Martin, “Introduction to Languages and the Theory of Computation”,
Third Edition, Tata McGraw Hill Publishing Company, New Delhi, 2007.
(UNIT 4,5)

REFERENCES:

1. Mishra K L P and Chandrasekaran N, “Theory of Computer Science -

Automata, Languages and Computation”, Third Edition, Prentice Hall of
India, 2004.

2. Harry R Lewis and Christos H Papadimitriou, “Elements of the Theory of

Computation”, Second Edition, Prentice Hall of India, Pearson Education,
New Delhi, 2003.
3. Peter Linz, “An Introduction to Formal Language and Automata”, Third
Edition, Narosa Publishers, New Delhi, 2002.

4. Kamala Krithivasan and Rama. R, “Introduction to Formal Languages,

Automata Theory and Computation”, Pearson Education 2009
NOTE :REFER NOTES FOR PART B PROBLEMS

Course Outcomes (COs)

C504.1 Design Finite State Automata and Regular Expression for any language

C504.2 Illustrate the design of Context Free Grammar for any language set

C504.3 Demonstrate the push down automaton model for the given language

C504.4 Make use of Turing machine concept to solve the simple problems

C504.5 Explain decidability or undesirability of various problems

 INDEX

Unit # Ref. Book

Hopcroft J.E., Motwani R. and Ullman J.D, “Introduction to Automata

Unit 1 Theory, Languages and Computations”, Second Edition, Pearson

Education, 2008. (UNIT 1,2,3)
Mishra K L P and Chandrasekaran N, “Theory of Computer Science -
Automata, Languages and Computation”, Third Edition, Prentice Hall of
India, 2004.
Hopcroft J.E., Motwani R. and Ullman J.D, “Introduction to Automata

Unit 2 Theory, Languages and Computations”, Second Edition, Pearson

Education, 2008. (UNIT 1,2,3)
Mishra K L P and Chandrasekaran N, “Theory of Computer Science -
Automata, Languages and Computation”, Third Edition, Prentice Hall of
India, 2004.
Hopcroft J.E., Motwani R. and Ullman J.D, “Introduction to Automata

Unit 3 Theory, Languages and Computations”, Second Edition, Pearson

Education, 2008. (UNIT 1,2,3)
Mishra K L P and Chandrasekaran N, “Theory of Computer Science -
Automata, Languages and Computation”, Third Edition, Prentice Hall of
India, 2004.
John C Martin, “Introduction to Languages and the Theory of

Unit 4 Computation”, Third Edition, Tata McGraw Hill Publishing Company,

New Delhi, 2007. (UNIT 4,5)

John C Martin, “Introduction to Languages and the Theory of

Unit 5 Computation”, Third Edition, Tata McGraw Hill Publishing Company,

New Delhi, 2007. (UNIT 4,5)
UNIT I FINITE AUTOMATA
Introduction- Basic Mathematical Notation and techniques- Finite State systems – Basic
Definitions –Finite Automaton – DFA & NDFA – Finite Automaton with €- moves – Regular
Languages- Regular Expression – Equivalence of NFA and DFA – Equivalence of NDFA’s with
and without €-moves –Equivalence of finite Automaton and regular expressions –Minimization
of DFA- - Pumping Lemma for Regular sets – Problems based on Pumping Lemma.

S. Question Course Outcome Blooms

No. Taxanomy
Level
Define

(a) Finite Automata (FA) C504.1 BTL 1

(b) Transition Diagram

NOV/DEC 2012

Finite Automata is a 5 tuples denoted by

A = (Q, ∑, δ, q0, F) where

1
• Q is a finite set of states

• ∑ is the finite set of input symbols

• δ is a transition function (Q X ∑ → Q )

• q0 is the start state or initial state

• F is a set of final or accepting states

2 State the Principle of induction.

NOV/DEC 2012
C504.1 BTL 1
Refer notes

3 What is proof by contradiction?

 MAY/JUNE 2012 Refer notes C504.1 BTL 1

Define ε-closure(q) with an example.

4 MAY/JUNE 2012
C504.1 BTL 1
Refer notes

Differentiate between proof by contradiction and

proof by contrapositive. APR/MAY 2011
C504.1 BTL 1
If H then C will be proved by assuming ~H and then
5
proving falsehood of falsehood of C. This is proof by
contadiction. Proof by contrapositive is proved by
assuming ~H and proving ~C.

Construct a DFA for the language over {0, 1}*

such that it contains “000” as a substring.
C504.1 BTL 1
APR/MAY 2011

1
6 0,1
Q0 Q1 Q2 Q3
0 0
0

What is structural induction?

NOV/DEC 2011
C504.1 BTL 1
Let S(X) be a statement about the structures X that
are defined by some particular recursive definition.

7 1. As a basis, Prove S(X) for the basis structure(s)

X.

2. For inductive step, take a structure X that the

recursive definition says is formed from Y1,
Y2,....Yk. Assume the statements S(Y1),...,S(Yk)
and use these to prove S(X).

State the difference between NFA and DFA.

NOV/DEC 2011
8 C504.1 BTL 1
DFA must emit one and only one vertex/line/edge for
each element of the alphabet. NFA do not have to
 obey this and can have multiple edges labeled with
the same letter (repetition) and /or edges labeled with
the empty string.

Both DFA and NFA recognize the same languages –

the regular languages.

1. Construct deterministic finite automata to

recognize odd number of 1’s and even
C504.1 BTL 1
number of 0’s?

APR/MAY 2010

9 1

1 B
A

0 0 0 0
C D
1

State the relations among regular expression,

deterministic finite automata, non deterministic finite
C504.1 BTL 1
automaton and finite automaton with epsilon
10
transition. APR/MAY 2010

Every Regular language defined by a regular

expression ia also defined by the finite automata. If a
Regular language ‘L’ is accepted by a NFA then
there exists a DFA that accepts ‘L’.
What is inductive proof?
NOV/DEC 2010
C504.1 BTL 1
Statement P(n) follows from

11 (a) P(0) and

(b) P(n-1) implies P(n) for n>=1

Condition (a) is an inductive proof is the basis and

Condition (b) is called the inductive step.

Find the set of strings accepted by the finite

12
automata. NOV/DEC 2010
C504.1 BTL 1
 0, 1

(0+1)* or L={ε, 0, 1, 00, 01, 10, 11,............}

What is meant by DFA

MAY/JUNE 2013
C504.1 BTL 1
DFA—also known as deterministic finite state
13
machine—is a finite state machine that accepts/rejects
finite strings of symbols and only produces a unique
computation (or run) of the automaton for each input
string.

Define the term Epsilon transition

MAY/JUNE 2013
C504.1 BTL 1
14 In the automata theory, a nondeterministic finite
automaton with ε-moves (NFA-ε)(also known as NFA-λ)
is an extension of nondeterministic finite
automaton(NFA), which allows a transformation to a new
state without consuming any input symbols
Draw the transition diagram for an identifier
NOV/DEC 2013
C504.1 BTL 1
15 letter letter,digit

What is non deterministic finite automata?

NOV/DEC 2013
C504.1 BTL 1
In automata theory, a nondeterministic finite automaton
16 (NFA), or nondeterministic finite state machine, is a finite
state machine that (1) does not require input symbols for
state transitions and (2) is capable of transitioning to zero
or two or more states for a given start state and input
symbol

Define Deductive Proof.

NOV/DEC 2014
17 C504.1 BTL 1
A Deductive proof consists of a sequence of
statements whose truth leads us from some initial
 statement, called the ‘hypothesis’ to a ‘conclusion’
statement.

“if H then C”

Ex: if x >= 4 then 2x >= x2

1. Design DFA to accept strings over ∑ = (0,1) with

two consecutive 0’s.NOV/DEC 2014
C504.1 BTL 1
1
0,1

18 q0 q1 q3

0 0

What is a finite automaton?

NOV/DEC 2015
C504.1 BTL 1
A finite automaton (FA) is a simple idealized
machine used to recognize patterns within input
taken from some character set (or alphabet) C. The
job of an FA is to accept or reject an input depending
on whether the pattern defined by the FA occurs in
the input.

Finite Automata is a 5 tuples denoted by

19
A = (Q, ∑, δ, q0, F) where

• Q is a finite set of states

• ∑ is the finite set of input symbols

• δ is a transition function (Q X ∑ → Q )

• q0 is the start state or initial state

• F is a set of final or accepting states

 Write Regular Expression for the set of strings over
20 {0.1} that have atleast one. NOV/DEC 2015
C504.1 BTL 1
Regualr Expression = (0+1)*1

Draw a Non-deterministic finite automata to accept

strings containing the substring 0101. MAY/JUNE
21 C504.1 BTL 1
2016 Refer Notes

State the pumping lemma for regular languages.

22
MAY/JUNE 2016Refer Notes
C504.1 BTL 1
Define the languages described by DFA and NFA.

L(DFA) = { w / δ‟(q0,w) is in F}.It is the set of C504.1 BTL 1

strings w that take the start state q0 to one of the
23 accepting states.

L(NFA)= { w / δ‟(q0,w)∩F≠ }.It is the set of

strings w such that δ‟(q0,w)contains at least one
accepting state.

Define extended transition function for a DFA.

The extended transition function δ‟: Qε∑ * εQ is C504.1 BTL 1

defined as follows.
24
(i) δ’(q, ε ) = q (ε - Empty)

(ii)Suppose w is a string of form xa(w= xa),

wε∑*and q Q , then δ’(q, w)= δ( δ’(q, x),a)

Give a regular expression for the set of all strings

25 having odd number of 1’s
C504.1 BTL 1
RE= 1(0+11)*

Give the regular expression for the set of all strings

26 ending in 00.
C504.1 BTL 1
Regular expression = (0+1)*00

When two states are equivalent and distinguishable?

27
We say that two states p and q are equivalent iff for C504.1 BTL 1
each input string x , δ(p,x) is an accepting state iff
 δ(q,x) is an accepting state. p is distinguishable from
q if there exists an x such that δ(p,x) is in F and v is
not in F or vice versa.

What are the applications of regular expression?

28 Regular expression in UNIX, Lexical analysis, C504.1 BTL 1
Pattern searching

Write regular expressions for the following.

(i)Binary numbers that are multiple of 2. (0/1)*. C504.1 BTL 1

29 (ii)Strings of a‟s and b‟s with no consecutive a‟s

.b* (abb*)(a / ε) (iii) Strings of a‟s and b‟s
containing consecutive a‟s. (a/b)*aa(a/b)*

State Arden’s theorem.

30 Let P and Q be two regular expressions over ∑. If P C504.1 BTL 1
does not contain null string ε over ∑ then R=Q+RP,
it has the solution R=QP*

PART B
1 Explain the different forms of proof with
examples. (8) NOV/DEC 2012
C504.1 BTL 1
2 Prove that, if L is accepted by an NFA with ε-
transitions, then L is accepted by an NFA without
C504.1 BTL 1
ε-transitions. (8) NOV/DEC 2012, NOV/DEC
2013

3 Prove that if n is a positive integer such that n

mod 4 is 2 or 3 then n is not a perfect square.
C504.1 BTL 1
(6) NOV/DEC 2012

4 Construct a DFA that accepts the following

(i) L={ x € {a,b}:|x|a = odd and |x|b = even}. C504.1 BTL 1

(10) NOV/DEC 2012

(ii) Binary strings such that the third symbol

from the right end is 1. (10) MAY/JUNE
2012
 (iii) All strings w over {0,1} such that the
number of 1’s in w is 3 mod 4.
(8) NOV/DEC 2011

(iv) Set of all strings with three consecutive

0’s.(10) NOV/DEC 2010

5 n
Prove by induction on n that  i = n(n + 1) / 2
i =0
C504.1 BTL 1
(6) MAY/JUNE 2012

6 Construct an NFA without ε-transitions for the

NFA give below. (8) MAY/JUNE 2012
C504.1 BTL 1
0 1
Q0 Q1
ε

Construct an NFA accepting binary strings with

7 two consecutive 0’s. (8) MAY/JUNE 2012

8` Show that a connected graph G with n vertices

and n-1 edges (n>2) has at least one leaf.
(6) APR/MAY 2011

• G has n vertices & (n-1) edges.

• Therefore ∑ deg(V) = 2(n-1) which is

impossible

• Therefore deg(V) = 1 for at least one vertex

and this vertex is a leaf.

9 Prove that there exists a DFA for every ε-NFA.

(8) APR/MAY 2011 Refer Notes

10 Distinguish NFA and DFA with examples.

MAY/JUNE 2013
UNIT II GRAMMARS
Grammar Introduction– Types of Grammar - Context Free Grammars and Languages–
Derivations and Languages – Ambiguity- Relationship between derivation and derivation trees –
Simplification of CFG – Elimination of Useless symbols - Unit productions - Null productions –
Greiback Normal form – Chomsky normal form – Problems related to CNF and GNF.

S. Question Course Blooms

No Outcom Taxanom
. e y Level
Give regular expressions for the following

L1=set of all strings of 0 and 1 ending in 00 C504.2

BTL 1

L2=set of all strings of 0 and 1 beginning with 0 and ending with

1
1. NOV/DEC 2012

RE1=(0+1)+ 00

RE2=0(0+1)+1

2 Differentiate regular expression and regular language.

NOV/DEC 2012
C504.2
BTL 1
Refer notes

Construct NFA for the regular expression a*b*.

3
MAY/JUNE 2012 Refer notes
C504.2
BTL 1
Is regular set is closed under complementation?Justify.
MAY/JUNE 2012
C504.2
BTL 1
Closure under complement

• If L is a regular language, over alphabet ∑

4
Complement of L=∑* - L

• Let L = L(A) for DFA A = (Q, ∑, δ, q0, F)

• Complement of L = L(B) where DFA B = (Q, ∑, δ, q0, Q-F)

• B is similar to A except accepting states of A have become non-

 accepting states of B and vice-versa.

A string w is in L(B) iff δ’ (q0,w) is in Q-F which occurs iff w

is not in L(A).

Prove that the complement of a regular language is also

regular.APR/MAY 2011
5 C504.2
BTL 1
Complement of L1 is constructed from L1 by reversing the states and
the arrows in automata.

Prove by pumping lemma, that the language 0n1n is not

6
regular.APR/MAY 2011
C504.2
BTL 1
Construct a DFA for the following:

(a) All strings that contain exactly 4 zeros. C504.2

BTL 1

(b) All strings that don’t contain the substring 110.

NOV/DEC 2011

1 1 1 1 1

0 0 0 0

7
0,1

1
0,1

1 1 0

Is the set of strings over the alphabet {0} of the form 0n where n
is not a prime is regular? Prove or disprove.
8 C504.2
BTL 1
NOV/DEC 2011

To prove this language is not regular, examine the complement

 because the set of regular languages is closed under complement.

Assume that the set is regular. Let p be the pumping length of the
language. Then, according to the pumping lemma, break the string
s=0p into s=xyz where y has positive length.

Then, s=xyiz=0p+(i-1)|y| must also be in the set for any i. In particular

let i=p+1.Then xyp+1z=0p+p|y| must be in the set so p+p|y| = p(1+|y|)
must be prime.

Thus we have a contradiction and the set cannot be regular.

Let L = {w:w ε {0,1}* w does not contain 00 and is not empty}.

9 Construct a regular expression that generates L.
C504.2
BTL 1
APR/MAY 2010

Regular Expression = (0+1)(1+10)*(101+1)*

Prove or disprove that the regular languages are closed under

concatenation and complement. APR/MAY 2010
C504.2
BTL 1
Closure under concatenation

• Since L and M are regular languages,they have regular

expressions

L=L(R) and M=L(S)

• Then L.M = L(R.S), by definition of regular expression

10 Closure under complement

• If L is a regular language, over alphabet ∑

Complement of L=∑* - L

• Let L = L(A) for DFA A = (Q, ∑, δ, q0, F)

• Complement of L = L(B) where DFA B = (Q, ∑, δ, q0, Q-F)

• B is similar to A except accepting states of A have become non-

accepting states of B and vice-versa.

• A string w is in L(B) iff δ’ (q0,w) is in Q-F which occurs iff w is

not in L(A).

11 Give the regular expression for set of all strings ending in

 00.NOV/DEC 2010 C504.2
BTL 1

(0+1)*00

State pumping lemma for regular set. NOV/DEC 2010,

NOV/DEC 2013,NOV/DEC 2014
C504.2
BTL 1
12 Let L be a regular set. Then there is a constant n such that if Z is a
string in L and |Z| >=n, Z can be written as Z=UVW such that |V|>=1
and |UV|<=n and for all i>=0 UViW is in L.

What is a regular expression ?

MAY/JUNE 2013
C504.2
BTL 1
13 A regular expression (abbreviated regex or regexp) is a sequence of
characters that forms a search pattern, mainly for use in pattern
matching with strings, or string matching, i.e. "find and replace"-like
operations

Name any four closure properties of regular languages

14 MAY/JUNE 2013
C504.2
BTL 1
union, intersection, complement, difference

Construct NFA equivalent to the regular expression (0+1)01

15 NOV/DEC 2013
C504.2
BTL 1
Refer notes

Prove or disprove that (r+s)* = r* + s*

16
NOV/DEC 2014 Refer notes
C504.2
BTL 1
Let G be the grammar with

S→aB|bA C504.2
BTL 1
17
A→a|aS|bAA

B→b|bS|aBB

What do you mean by null production and unit production? Give an

18 example. MAY / JUNE 2016
C504.2
BTL 1
Refer notes

Construct a CFG for set of strings that contain equal number of a’s
19
and b’s over ∑ = {a,b}. MAY / JUNE 2016
C504.2
BTL 1
 S->A|B

A→aA|€

B→bB|€

What is unambiguity?
20
Refer notes
C504.2
BTL 1
Mention the application of CFG.
21
Refer notes
C504.2
BTL 1
Construct the Context free grammar representing the set of
22 palindromes over (0+1)* NOV/DEC 2015
C504.2
BTL 1
S->0S0|1S1| ε

What is meant by Context Free Grammar (CFG)? NOV/DEC

23
2016
C504.2
BTL 1
State Chomsky normal form theorem. NOV/DEC 2016
24
C504.2
BTL 1
Define Regular Expression.
25
Refer Notes
C504.2
BTL 1
26 What is null and unit production?
Refer Notes C504.2
BTL 1

PART B
1 Prove that there exists an NFA with ε-transitions that accepts the
regular expression γ. (10)
C504.2
BTL 1
MAY/JUNE 2012, NOV/DEC 2010

2 Which of the following languages is regular? Justify.(Using

Pumping Lemma)
C504.2
BTL 1
(i) L={anbm | n,m>=1}

(ii) L={anbn | n>=1} (8)

MAY/JUNE 2012

(iii) L={ambn | m>n} (10)

NOV/DEC 2012

(iv) L={anbn | n>=1} (6)

NOV/DEC 2010
 (v) L={0n2| n is an integer, n>=1} (6)
NOV/DEC 2014

3 Obtain the regular expression for the finite automata.

(8) MAY/JUNE 2012
C504.2
BTL 1
a a
q0 q1 q2

4 Prove any two closure properties of regular

languages.(8)NOV/DEC 2012, NOV/DEC 2011, APRIL/MAY
C504.2
BTL 1
2010

5 Construct a minimized DFA from the regular expression

(i) (b/a)*baa (10) C504.2

BTL 1
MAY/JUNE 2012

(ii) 0*(01)(0/111)* (16)

NOV/DEC 2012

(iii) (x+y)x(x+y)*. Trace for a string w=xxyx. (16)

NOV/DEC 2011

(iv) (a+b)(a+b)* and trace for a string baaaab. (16)

APR/MAY 2010

(v) (b/a)*baa (16)

NOV/DEC 2010

(vi) 10+(0+11)0*1 (16)

NOV/DEC 2014

6 Construct a regular expression for the following DFA using

kleene’s theorem. (10) APR/MAY 2011
C504.2
BTL 1
0 1
→*A A B
B C B
C A B

7 Construct a ε-NFA for the following regular expression. (6)

 APR/MAY 2011
C504.2
BTL 1
(i) (0+1)*(00+11)(0+1)*

8 (i) What is the purpose of normalization? Construct the CNF and

GNF for the following grammar and explain the steps. (10)
C504.2
BTL 1
MAY/JUNE 2016

S→aAa | bBb |€
A→C|a
B→C|b
C→CDE | €
D→A|B|ab
(ii) Constuct a CFG for the regular expression (011+1)(01). (6)
MAY/JUNE 2016

UNIT III PUSHDOWN AUTOMATA

Pushdown Automata- Definitions – Moves – Instantaneous descriptions – Deterministic
pushdown automata – Equivalence of Pushdown automata and CFL - pumping lemma for CFL –
problems based on pumping Lemma.

S. Question Course Outcome Blooms

No. Taxanomy
Level
What is ambiguous grammar?
1 NOV/DEC 2012, MAY/JUNE 2013
C504.3 BTL 1
Refer notes

What are the diiferent types of language accepted

2 by a PDA and define them? NOV/DEC 2012
C504.3 BTL 1
 • Accepted by null state

• Accepted by final state

Specify the use of context free grammar.

3 MAY/JUNE 2012
C504.3 BTL 1
Refer notes

Define parse tree with an example.

4 MAY/JUNE 2012
C504.3 BTL 1
Refer notes

Construct a CFG over {a,b} generating a language

consisting of equal number of a’s and b’s.
5 C504.3 BTL 1
APR/MAY 2011

S→ aSbS | bSaS | SS

Is the language of Deterministic PDA and Non –

deterministic PDA same? APR/MAY 2011
6 C504.3 BTL 1
The language is not same. This language of NPDA is
a superset of the language of DPDA.

Is the grammar below ambiguous S→ SS | (S) |

S(S)S | E?NOV/DEC 2011
C504.3 BTL 1
7 • It is ambiguous

• The sentence such as E(E)E can have more

than one LMD (or) RMD (or) Parse tree.

Convert the following grammar into an equivalent

one with no unit productions and no useless
symbols S→ABA A→aAA|aBC|bB B→ C504.3 BTL 1
8
A|bB|Cb C→CC|Cc NOV 2011

Refer notes

Consider the following grammar G with

productions APR/MAY 2010
C504.3 BTL 1
9
S→ ABC | BaB

A→aA|BaC|aaa
 B→bBb|a

C→CA|AC

Give a CFG with no useless variables that

generates the same language.

Symbol C is non-generative, after removing

productions with C we have,

S→ BaB

A→ aA|aaa

B→bBb|a

CFG with no usless variables

{S→ BaB A→ aA|aaa B→bBb|a}

State the definition of Pushdown automata.

APR/MAY 2010
C504.3 BTL 1
A pushdown automaton consists of 7 tuples

P = (Q, ∑, Г, δ, q0, Z0, F)

Where Q – A finite non empty set of states

∑ - A finite set of input symbols

Г – A finite non empty set of stack symbols

δ - The transition function is given by

δ:Q X (∑ U {ε}) X Г → Q X Г*
10
q0 – q0 in Q is the start state

Z0 - Initial start symbol of the stack

F - F in Q, set of accepting states or final

states.

Write down the context free grammar for the

language L = { anbn |n>=1} NOV/DEC 2010,
11 C504.3 BTL 1
NOV/DEC 2013

S→ aSb |ab
 Is the grammar E→E+E|id is ambigupus ?
Justify. NOV/DEC 2010
C504.3 BTL 1
12
• It is ambiguous, The sentence such as
id+id+id can have more than one
LMD (or) RMD (or) Parse tree.

What is a CFG ? MAY/JUNE 2013

A context-free grammar (CFG) is a formal C504.3 BTL 1

grammar in which every production rule is of the
form V → w where V is a single nonterminal symbol,
and w is a string of terminals and/or nonterminals (w
13 can be empty). A formal grammar is considered
"context free" when its production rules can be
applied regardless of the context of a nonterminal.
No matter which symbols surround it, the single
nonterminal on the left hand side can always be
replaced by the right hand side.

What are the different ways of language

acceptances by a PDA and define them?
C504.3 BTL 1
NOV/DEC 2015
14
• Language accepted by a Empty store

• Language accepted by a Final state.

Define pushdown Automaton MAY/JUNE

2016
C504.3 BTL 1
A pushdown Automaton is a - NFA with
stack data structure where it can push strings
into and pop strings out of stack.
It consists of 7-tuples P = ( Q,,,,q0, z0
15 , F),Where Q is a finite set of states,is a
finite set of input symbols,is a finite set of
nonempty stack alphabets, is a transition
function,q0 is an initial state, Z 0 is the initial
start symbol of the stack , F is the set of
accepting states.is defined
as :Q()→Q*
16 What are the different ways of language
acceptances by a PDA and define them
 There are two ways of language acceptances, C504.3 BTL 1
1)Acceptance by final state .L(M)= w |
(q0,w,Z0) *(q, ,) for some q in F
and in *
Compare NFA and PDANOV/DEC 2013
17
Refer notes C504.3 BTL 1

Give the general forms of CNF. NOV/DEC 2014

18 A→BC C504.3 BTL 1

A→a

Show that CFLs are closed under substitutions

19
NOV/DEC 2014 Refer notes
C504.3 BTL 1
Convert the following CFG to a PDA.NOV/DEC
20
2015 S→aAA, A→aS|bS|a
C504.3 BTL 1
Does a Push down Automata have memory? Justify.
21 MAY/JUNE 2016 Refer Notes
C504.3 BTL 1

22
When is Push Down Automata (PDA) said to C504.3 BTL 1
be deterministic? NOV/DEC 2016

23 What are the conventional notations of Push C504.3 BTL 1

Down Automata? NOV/DEC 2016

List the main application of pumping Lemma

24
in CFL’s
C504.3 BTL 1
Compare Deterministic and Non deterministic PDA. Is
25
it true that non deterministic PDA is more powerful than
C504.3 BTL 1
that of deterministic PDA? Justify your answer.
26
Design the equivalence of PDA and CFG
C504.3 BTL 1
PART – B
Consider the following grammar for list
structures:
C504.3 BTL 1
 S→a|^|(T) T→T,S|S

1 Find left most derivation, rightmost derivation

and parse tree for (((a,a),^(a)),a)(10) NOV/DEC
2012

Construct the PDA accepting the language

1. L={(ab)n|n>=1} by empty stack. (6) C504.3 BTL 1

NOV/DEC 2012

2. L={a2nbn|n>=1} Trace your PDA for the input

2 with n=3. (10) NOV/DEC 2012

3. L={wwR|w is in (a+b)*} (10)MAY/JUNE 2012

4. L={0n12n} by empty stack(8)APR/MAY 2011

5. L={wwRw|w is in {0+1}*}(10)NOV/DEC 2010

Find the PDA equivalent to the given CFG with

the following productions
C504.3 BTL 1
1. S→A, A→BC, B→ba, C→ac (6) NOV/DEC
2012
3
2. S→aSb|A, A→bSa|S| ε (10) NOV/DEC 2011

Is the following grammar is ambiguous? Justify

your answer.
C504.3 BTL 1
4 1. E→ E+E |E*E | id (6) MAY/JUNE 2012

2. E→ E+E|E*E|(E)|a (4) APRIL/MAY 2011

Find the context free languages for the following

5 grammars.
C504.3 BTL 1
1. S→aSbS|bSaS| ε (10)
MAY/JUNE 2012

2. S→aSb|ab

3. S→aSb|aAb, A→bAa, A→ba (6)

NOV/DEC 2011

6 Prove that if there exists a PDA that accepts by

final state then there exists an equivalent PDA
C504.3 BTL 1
 that accepts by Null state. (8)
APRIL/MAY 2011

7 Is NPDA (Nondeterministic PDA) and DPDA

(Deterministic PDA) equivalent? Illustrate with
C504.3 BTL 1
an example. (8) NOV/DEC 2011

8 What are the different types of language

acceptances by a PDA and define them. Is it true
C504.3 BTL 1
that the language accepted by a PDA by these
different types provides different languages?
(8) NOV/DEC 2011

9 Construct PDA for the language

L = {wwR | W in (a+b)*)} MAY/JUNE C504.3 BTL 1

2013,NOV/DEC 2013, MAY/JUNE 2016

UNIT IV TURING MACHINES

Definitions of Turing machines – Models – Computable languages and functions –Techniques
for Turing machine construction – Multi head and Multi tape Turing Machines - The Halting
problem –Partial Solvability – Problems about Turing machine- Chomskian hierarchy of
languages.

S. Question Course Outcome Blooms

No. Taxanomy
Level
State the pumping lemma for CFLs.
1
NOV/DEC 2012 Refer notes
C504.4 BTL 1
What are the applications of Turing Machine?
2 NOV/DEC 2012 Refer notes
C504.4 BTL 1

State pumping lemma for CFL.

3
MAY/JUNE 2012 Refer notes
C504.4 BTL 1
What is chomsky normal form?
4
MAY/JUNE 2012 Refer notes
C504.4 BTL 1
 What is the height of the parse tree to represent a
5 string of length ‘n’ using Chomsky normal form?
APR/MAY 2011 C504.4 BTL 1
n+1
Construct a Turing machine to compute ‘n mod 2’
where n is represented in the tape in unary form
consisting of only 0’s. APR/MAY C504.4 BTL 1
2011
0 B
6 q0 (q1,B,R) (q2,B,R)
q1 (q0,B,R) (q3,B,R)
q2 - -
representing even no
q3 - -
representing odd no

Design a TM that accepts the language of odd

integers written in binary. NOV/DEC 2011
C504.4 BTL 1
7 To accept odd valued binary strings, we only have to
look at the last bit. The TM moves right until it reads
a blank, moves left one space and acepts if and only
if there is a 1 on the tape.

State the two normal forms and give an example.

NOV/DEC 2011
C504.4 BTL 1
8
1. Chomsky normal form A→BC |a

2. Greibach normal form X→bYXZ|a

Convert the following grammar G in greibach

normal form.APR/MAY 2010
C504.4 BTL 1
S→ABb|a A→aaA|B B→bAb

• No ε production in the given grammar

9
• Eliminating unit production A→B we have
S→ABb|a A→aaA|bAb B→bAb

• Eliminating useless variables A & B (non generating)

S→a

Design a Turing machine with no more than three

states that accepts the language a(a+b)*. Assume
C504.4 BTL 1
 ∑ = {a,b} APR/MAY 2010

TM M=(Q, ∑, Г, δ, q0, B,{q2})

Q – {q0,q1,q2}
10 ∑ - {a,b}

Г – (a,b,B}

q0 – Initial state

q2 - Final state

δ - Transition function given as follows

δ(q0,a) = (q1,a,R)

δ(q1,a) = (q1,a,R)

δ(q1,b) = (q1,b,R)

δ(q1,B) = (q2,B,R)

What is Turing machine? NOV/DEC 2010

TM is denoted by C504.4 BTL 1

M=(Q, ∑, Г, δ, q0, B,F)

where

Q – A finite non empty set of states

∑ - A finite set of input symbols

11
Г – A finite non empty set of tape symbols

δ - The transition function is given by

δ:Q X Г → Q X Г X {L,R,S}

q0 – Initial state

B ε Г – Blank Symbols

F - Final state

What are the required fields of an instantaneous

12
description of a Turing machine? NOV/DEC 2016
C504.4 BTL 1
 List the primary objectives of Turing Machine.
13
NOV/DEC 2016
C504.4 BTL 1
Is the language L={anbncn
| n>=1} is context
free?Justify.NOV/DEC 2010
C504.4 BTL 1
14
It is not context free.

Pumping Lemma for CFL is not satisfied.

What is meant by Greibach Normal Form ?

MAY/JUNE 2013
C504.4 BTL 1
A context-free grammar is in Greibach normal form
15 (GNF) if the right-hand sides of all production rules start
with a terminal symbol, optionally followed by some
variables. A non-strict form allows one exception to this
format restriction for allowing the empty word (epsilon,
ε) to be a member of the described language

List the closure properties of Context Free

Languages MAY/JUNE 2013, NOV/DEC 2013
16 C504.4 BTL 1
Union, intersection, kleene closure, substitution,
homomorphism

List out the different techniques for turing

17 machine construction.NOV/DEC 2013
C504.4 BTL 1
Refer notes

Let G be the grammar S→aB|bA A→a|aS|bAA

B→b|bS|aBB. For the string aaabbabbba, Find (a)
18 C504.4 BTL 1
LMD (b) RMD NOV/DEC 2014

Refer Notes

Define Diagonalization (Ld) Language.

19 NOV/DEC 2014
C504.4 BTL 1
Ld={wi | wi ∑ L(Mi)}

Define a Turing Machine. OV/DEC 2015

20
Refer notes C504.4 BTL 1
 What is a multitape turing machine?
21 NOV/DEC 2015Refer notes
C504.4 BTL 1

What are the differences between a Finite automata

22
and a Turing machine? MAY/JUNE 2016
C504.4 BTL 1
What is Turing Machine? MAY/JUNE 2016
23
C504.4 BTL 1
What is multitape Turing machine? Explain in one
24
move. What are the actions take place in TM?
C504.4 BTL 1
What are the applications of Turing Machine?
25
C504.4 BTL 1
What are the techniques for TM construction?
26
C504.4 BTL 1
PART – B
Convert the following grammar into CNF

S→cBA, S→A, A→cB, A→AbbS, B→aaa C504.4 BTL 1

(6) NOV/DEC 2012

1 S→a|AAB, A→ab|aB| ε, B→aba| ε

(8) APR/MAY 2011

S→A|CB, A→C|D, B→1B|1, C→0C|0, D→2D|2

(16) APR/MAY 2010

S→aAD A→aB|bAB B→ b D→ d
(6) NOV/DEC 2014

State and prove the pumping lemma for CFL.

2 What is its main application? Give two examples.
C504.4 BTL 1
(10)

NOV/DEC 2012, NOV/DEC 2011, MAY/JUNE

Design a Turing machine for the following

Reverses the given string {abb}. (8) NOV/DEC C504.4 BTL 1

2012

3 L={1n0n1n|n>=1} (10) MAY/JUNE 2012

 L={anbncn} (8) APR/MAY 2011

To perform proper subtraction (8) APR/MAY

2011

To move an input string over the alphabet A ={a}

to the right one cell. Assume that the tape head
starts somewhere on a blank cell to the left of the
input string. All other cells are blank, labeled by
^. The machine must move the entire string to the
right one cell, leaving all remaining cells blank.
(10) APR/MAY 2010
L={1 0n|n>=1}
n (8) NOV/DEC 2010

L={wwR| w is in (0+1)*} (8) NOV/DEC 2010

mplement the function “MULTIPLICATION”

using the subroutine “COPY”.
(12) NOV/DEC 2014

L={0n1n|n>=1} (10) NOV/DEC 2015

Write briefly about the programming techniques

for TM. (8) NOV/DEC 2012,MAY/JUNE
C504.4 BTL 1
2013, NOV/DEC 2015
4
Find Greibach normal form for the following
5 grammar
C504.4 BTL 1
(i) S→AA | 1, A→SS |0
(10) MAY/JUNE 2012

(ii) S→a|AB, A→a|BC, B→b, C→b

(4) APR/MAY 2011

(iii) S→AA|0, A→SS|1

(8) NOV/DEC 2010

(iv) A1→A2A3, A2→A3A1|b, A3→A1A2|a

(10) NOV/DEC 2014

6 Explain the different models of Turing machines.

(10) NOV/DEC 2011
C504.4 BTL 1
7 Discuss the various techniques for Turing
 Machine Construction (16) NOV/DEC 2016
C504.4 BTL 1
8 (i) Write about Multi tape Turing Machines. (10)
NOV/DEC 2016
C504.4 BTL 1
(ii) Explain highlight the implications of halting
problems (6) NOV/DEC 2016
9 Describe the Chomsky hierarchy of languages.
NOV/DEC 2015
C504.4 BTL 1

UNIT V UNSOLVABLE PROBLEMS AND COMPUTABLE FUNCTIONS

Unsolvable Problems and Computable Functions – Primitive recursive functions –

Recursive and recursively enumerable languages – Universal Turing machine. MEASURING
AND CLASSIFYING COMPLEXITY: Tractable and Intractable problems- Tractable and
possibly intractable problems - P and NP completeness - Polynomial time reductions.

PART - A
S. Question Course Outcome Blooms
No. Taxanomy
Level
When we say a problem is decidable? Give an
1 example of undecidable problem. NOV/DEC
C504.5 BTL 1
2012 Refer notes
 What is recursively enumerable language?
NOV/DEC 2012, MAY/JUNE 2012, NOV/DEC
2 C504.5 BTL 1
2010, MAY/JUNE 2013, NOV/DEC 2013

REL is the language accepted by a Turing Machine.

Mention the difference between P and NP

3 problems. MAY/JUNE 2012
C504.5 BTL 1
Refer notes

How to prove that the Post Correspondence

problem is Undecidable. NOV/DEC 2011
Introduce a modified PCP and reduce the same to the C504.5 BTL 1
4 original PCP.
Again reduce Lu to the modified PCP.
The chain of reduction infers if original Lu is known
to be undecidable then conclude that PCP is
undecidable.
Show that any PSPACE-hard language is also NP-
hard. NOV/DEC 2011
First we must show that the language is not in NP. C504.5 BTL 1
This is trivial since NP is a subset of PSPACE and
5
therefore, anything outside of PSPACE is also
outside of NP.
Then we must show that any problem in NP can be
reduced to any PSPACE-hard language. Thus, any
PSPACE-hard problem is also NP-hard.
State Rice’s theorem. APR/MAY 2010
Every non-trivial property of the RE language is
6 undecidable. C504.5 BTL 1
A property is trivial if it is either empty such that it is
satisfied by no language or is all RE languages, or
else it is non-trivial.
Show that the collection of all Turing machines is
countable.APR/MAY 2010
• If for a set there is an enumerator, then the set C504.5 BTL 1
is countable.
• Any Turing Machine can be encoded with a
binary string of 0’s and 1’s.
7 • An enumeration procedure for the set of
Turing Machine strings:
Repeat
• Generate the next binary string of 0’s and
1’s in proper order
• Check if the string describes a Turing
Machine
If Yes: Print string on output tape
 If No: Ignore string
Mention the difference between decidable and
undecidable problems. NOV/DEC 2010
C504.5 BTL 1
8
• Decidable Problem – Existence of an
algorithm
• Undecidable Problem – No algorithm
for solving it.
What is universal turing machineNOV/DEC 2013
universal Turing machine (UTM) is a Turing
machine that can simulate an arbitrary Turing C504.5 BTL 1
9
machine on arbitrary input. The universal machine
essentially achieves this by reading both the
description of the machine to be simulated as well as
the input thereof from its own tape
Define multiple turing machine.
NOV/DEC 2014
10 An extended TM model has more number of tapes. A C504.5 BTL 1
move is based on the state and on the vector of
symbols scanned by the hand on each of the tapes.

Give example for NP-complete problems.

11
NOV/DEC 2014
Traveling Salesman Problem C504.5 BTL 1
State when a problem is said to be decidable and
12
give an example of an undecidable problem.
NOV/DEC 2015 C504.5 BTL 1
What is a universal Language Lu?
13
NOV/DEC 2015 Refer notes
C504.5 BTL 1
When is a Recursively Enumerable language said to
14
be Recursive? MAY/JUNE 2016
C504.5 BTL 1
Identify whether “Tower of Hanoi” problem is
15
tractable or intractable. Justify your answer.
MAY/JUNE 2016 C504.5 BTL 1
Define Universal Turing Machine NOV/DEC 2016
16
C504.5 BTL 1
Define NP-hard and NP-complete problems.
17
NOV/DEC 2016
C504.5 BTL 1
When a recursively enumerable language is said to
18
be recursive.
C504.5 BTL 1
Compare and Contrast recursive and recursively
19
enumerable languages.
C504.5 BTL 1
 State when a problem is said to be decidable and give
20
an example of an undecidable problem
C504.5 BTL 1
Is it true that the language accepted by a non
21 deterministic Turing Machine is different from
recursively enumerable language? C504.5 BTL 1

Give two properties of recursively enumerable sets

22
which are undecidable.
C504.5 BTL 1
Define the classes of P and NP
23
C504.5 BTL 1
When a language is said to be recursively
24
enumerable?
C504.5 BTL 1
Define Time and Space Complexity of TM.
25
C504.5 BTL 1
Distinguish between PCP and MPCP. What are the
26
concepts used in UTMs?
C504.5 BTL 1
PART – B
If L1 and L2 are recursive language then L1UL2 is
1 a recursive language.(6)NOV/DEC 2012
C504.5 BTL 1
Prove that the halting problem is undecidable.(10)
2 NOV/DEC 2012, NOV/DEC 2010
C504.5 BTL 1
State and prove the Post’s correspondence
3 problem. (10)NOV/DEC 2012,
NOV/DEC 2010 C504.5 BTL 1

Write a note on NP problems.

4 (6) NOV/DEC 2012
C504.5 BTL 1
Explain undecidability with respect to post
5 correspondence problem. (8) MAY/JUNE2012
C504.5 BTL 1
6 State and prove Post Correspondence Problem
and Give example. (16) NOV/DEC 2014
C504.5 BTL 1
7 What is Post Correspondence problem (PCP)?
Explain with the help of an example. (16)
MAY/JUNE 2016 C504.5 BTL 1
8 (i) What are tractable problems? Compare it with
intractable problems. (10) NOV/DEC 2016
 (ii) Outline the concept of polynomial time C504.5 BTL 1
reductions. (6) NOV/DEC 2016
9 Prove that for two recursive languages L1 and L2
their union and intersection is recursive.
C504.5 BTL 1
NOV/DEC 2013

10 State and explain RICE theorem.

Prove that “MPCP reduces to PCP”. C504.5 BTL 1