NCU-FORM-29
Question paper for Re-Major Test Review Date:
School of Engineering & Technology Semester: Odd VII
THE Programme: B-Tech Session: July-Dec
NORTHCАР 2021
UNIVERSITY Course Name: Theory of Computation
POWERED BY Course Code: CSL318 *Maximum
Arizona State University
Marks: 70
14 FEB 2022 *Duration: 2 hrs
Sheet 1 of 3
Note: 1. All questions are compulsory in Section A.
2. Marks are indicated against the questions.
3. Calculator is permitted.
Section A (25 Marks)
COI Q1. Explain NFA with tuple notation.
4Marks
CO1 Q2. Which of the following is accepted by NPDA but Not by DPDA? 4MarkS
a) {a b c" |n ≥0}
b) {a b n≥0}
c) {a bm m, n≥0}
d) {a¹ bm c" 1 m or m≠n}
CO2 Q3.What are the different types of grammar and their languages? 4Marks
CO5 Q4. Differentiate between recursive and recursively enumerable languages? 4Marks
CO4 Q5. Number of trivial substrings in "Automata" are: 2MarkS
a) 2
b) 4
c) 14
d) 28
CO3 Q6. Which one of the Regular Expression given defines the same language as defined by R 4Marks
= (a +b)* (aa + bb) (a+b)* ?
a) (a) (a (ba)*+b (ab)*) (a + b)*
b) (b) (a (ba)* + b (ab)*)* (a +b)*
c) (c) (a (ba)* (a + bb) + b (ab)* (b +aa)) (a +h)*
d) (d) (a (ba)* (a + bb) + b (ab)* (b + aa)) (a +b)+
CO5 Q7. Which of the following is not performed with the help of Turing Machine? 3Marks
(i) Addition of two Numbers i.e., f(m,n) =m+n
(ii) Multiplication of two numbers i.e., f(m,n) m+n =
(iii) Acceptance of language L={W/W¢(a,b).}
(iv) Acceptance of language L={anbncndnen/n≥1}
a) i and ii
b) iii and iv
c) iii only
d) None of these
Issued by: Approved by:
Date: Date:
Section B (45 Marks)
CO2 Q1. a) What type of binary strings is accepted by the following finite automata? (8+7=15
marks)
이
0 이
१० 91 92
1
0
0
1 0
१ 94
CO1 Q1. b) Minimize the following.
3b
q
b
a
oq a
a b
q2 g4
b
OR
CO2 Q1. a) What is Arden's theorem. Explain its use with an example.
CO1 Q1. b) Convert the following into its equivalent machine.
0/0
0/1
1/0
92
93
1/1
CO3 Q2. a) What do you mean by ambiguity of a grammar? Check if the following grammar is (8+7=15
ambiguous or not. marks)
SAB/C
A→ aAb/ab
B cBd/cd
Issued by: Approved by:
Date: Date:
C→ aCd/aDd
DbDc / bc
CO2 Q2. b) What is the regular expression for a language {w| w starts and ends with same
symbol} over Σ={a,b}
OR
CO3 Q2. a) Construct a CFG for the language L = {a"b²n |n>=1}.
CO2 Q2. b) Discuss the pumping lemma for Regular language with some examples.
CO4 Q3.a) Construct a Turing machine for L= {0"1"|n>=1} and discuss its working with (7+8=15
transition table. marks)
CO5 Q3.b) Let<M> be the encoding of Turing machine as a string over Σ = {0, 1}. Let L=
{<M>| M is TM on input w will visit some state P}.
The language L will be decidable or not? Justify.
OR
CO4 Q3.a) Design a suitable automaton for the given language.
L= {amb(n+m)cm m, n>=1}
CO5
Q3.b) S1: L≤m {01" n ≥ 0} then L is decidable.
S2: if L is R.E. and L'SL then L' is recursively enumerable because enumerator
for L also enumerates L'.
Which of the above statements are true? Justify your answer.
Issued by: Approved by:
Date: Date:
