Scribd
Upload
82 views1 page

Nepal Engineering College: Set C

This document contains a sample exam paper for the Theory of Computation course at Nepal Engineering College. It consists of 7 questions worth a total of 100 marks. The questions cover topics like: 1. Defining the components of a transition graph and epsilon transitions in finite automata. 2. Proving a language is not regular using the pumping lemma and defining regular expressions. 3. Constructing context-free grammars and converting grammars to Greiback normal form. 4. Discussing the relationship between pushdown automata and context-free grammars in terms of language recognition abilities.

Uploaded by

Kishor Kadel
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
82 views1 page

Nepal Engineering College: Set C

This document contains a sample exam paper for the Theory of Computation course at Nepal Engineering College. It consists of 7 questions worth a total of 100 marks. The questions cover topics like: 1. Defining the components of a transition graph and epsilon transitions in finite automata. 2. Proving a language is not regular using the pumping lemma and defining regular expressions. 3. Constructing context-free grammars and converting grammars to Greiback normal form. 4. Discussing the relationship between pushdown automata and context-free grammars in terms of language recognition abilities.

Uploaded by

Kishor Kadel
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

NEPAL ENGINEERING COLLEGE (b)Write closure properties of recursive and recursively enumerable languages (7)

Level: Bachelor Year : 2016 5. (a)Construct the turning machine for the language L={ 0n1n / n>=0} (8)
Programme: BE Full Marks : 100 OR
Pass Mark : 45 Explain TM and universal TM.
Course: Theory of Computation Time : 3 hrs (b)State and explain Church thesis. (7)
6. (a)Define primitive recursive function. Show that addition function of two positive
integers is primitive recursive. (8)
SET C (b)What do you mean by tractable and intractable problem? Write about NP hard and NP
complete problem. (7)
1. (a)What are the three things that collectively define a transition graph? (7)
7. Write short note on any two (5*2)
(b)What do you mean by E-transition? Construct an equivalent FA without epsilon moves
i. Chomsky hierarchy
from the following FA with epsilon moves. (8)
ii. String and language
b a a
iii. Regular expression
Ű, Ű,
1 2 3

2. (a)What is pumping lemma for regular set? Prove that the language {anban, n =
0,1,2,3……} is not regular. (7)
(b)Define regular expression. Write regular expression for the set of strings of 0s and 1s
whose 10th symbol is 1 from right. (8)

3. (a)Define context free grammar. Construct a CFG for language L= {wcwr/w∈ (a,b) for
the string abbcbba from (8)
S→asa
S→bsb
S→c

(b)What is Greiback Normal Form (GNF)? Convert the following Grammar into GNF(7)
S→AB/BC
A→aB/bA/a
B bB/cC/b
C→c

4. (a) “Generally we can say PDA is stronger than FA” Justify this statement. Write closure
or relationship between PDA and CFG. (8)
OR
Discuss the power of PDA in relation to language acceptance. Is the conversion NPDA to
DPDA possible?

You might also like