Seat No.: ________ Enrolment No.

___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VI (NEW) EXAMINATION – SUMMER 2023
Subject Code:3160704 Date:04-07-2023
Subject Name:Theory of Computation
Find inverse then In this
Time:10:30 AM TO 01:00 PM Total
case, theMarks:70
pair (p,1)(p,1)
Instructions: violate the rule of a
1. Attempt all questions. function because • p is
related to two different
2. Make suitable assumptions wherever necessary.
elements (1 and 2).
3. Figures to the right indicate full marks. Therefore, f is not an
Similarities
4. Simple and non-programmable scientific calculators are allowed.
inverse function.
1. Both are finite
state machines
(FSMs) used for Marks
sequential logic
design. Q.1 (a) Let f be a function from the set 𝐴 = {1,2,3,4} to 𝐵 = {𝑝, 𝑞, 𝑟, 𝑠} such that, 𝑓 =
03
2. Both have {(1, 𝑝)(2, 𝑝)(3, 𝑞)(4, 𝑠)}. Is 𝑓 −1 a function?
states and (b) 𝐿 is defined recursively as follows:
transitions
governed by input 1. 𝜖 ∈ 𝐿
symbols. 2. ∀𝑥 ∈ 𝐿, both 0𝑥 and 0𝑥1 are in𝐿. 04
3. Both can be Prove that: For every 𝑛 >= 0, every 𝑥 belongs to 𝐿 obtained by n applications
converted into
each other.
of rule 2 is an element of L.
4. Both can be (c) Discuss “Distinguishability” of one string from another and explain how it
represented using affects the number of states in an FA. Considering the example of 𝐿 =
state diagrams {𝑎, 𝑏}∗ {𝑎𝑏𝑎}, how do the distinguishable strings in L relate to the number of 07
and state tables.
Differences** states in its FA?
1. **Output
Dependency Q.2 (a) Define: Grammar. 03
2. **Reaction to
Input Change (b) What are similarities and differences between Moore machines and Mealy
04
3. **State machines?
Complexity (c) Given two languages 𝐿1 and 𝐿2 , defined as:
4. **Output Timing
𝐿1 = {𝑥 | 𝑎𝑙𝑙 𝑥 𝑠𝑡𝑎𝑟𝑡 𝑤𝑖𝑡ℎ 𝑎𝑏𝑎 }
𝐿2 = {𝑥 | 𝑎𝑙𝑙 𝑥 𝑒𝑛𝑑𝑠 𝑖𝑛 𝑏𝑏}
07
Write the regular expression for both the languages and construct FAs 𝑀1 and 𝑀2
such that 𝑀1 accepts 𝐿1 and 𝑀2 accepts 𝐿2 . Derive 𝐿1 ∩ 𝐿2 .

OR

(c) Draw the given NFA in Table-1 and convert it to FA and identify the language.
07
q0 is the initial state and q1 is the accepting state.

Q.3 (a) Draw NFA lambda for the given regular expression:
03
(0)* (00 + 11)* (001) (01 + 10)
(b) Explain the Pumping Lemma for Context Free Languages. 04
(c) Convert the following grammar to CNF.
S → ABA
07
A → aA | ϵ
B → bB | ϵ
OR
Q.3 (a) Find the ꓥ-closure of a set of states for each state of the given NFA lambda in
03
Figure-1.
(b) What are non-CFLs? Give at-least two examples of non-CFLs. 04
(c) Show Bottom Up Parsing of the string “id + id * id” using the following grammar.
E→E+T|T 07
T→T*F|F
1
 F → (E) | id

Q.4 (a) Define PDA. State whether a PDA can accept a CFL or not. 03
(b) Discuss the closure properties of CFLs. 04
(c) For the given Turing Machine in Table-2, trace the transition for the strings 1011
and 10101 and identify the language recognized by this TM. TM is defined as TM
07
= (Q, Σ, Γ, q0, δ ) where {q0,q1,q2,q3,q4,q5,q6} ∈ Q, Σ = {0,1}, {0,1,X,Y,B} ∈ Γ,
q0 ∈ Q, B ∈ Γ , B ∉ Σ, {q6} is the accepting state.
OR
Q.4 (a) Compare NPDA with DPDA. 03
(b) Show that if there are strings 𝑥 and 𝑦 in the language 𝐿 so that 𝑥 is a prefix of 𝑦
04
and 𝑥 ≠ 𝑦, then no DPDA can accept 𝐿 by empty stack.
(c) Draw a TM for the Language of strings with balanced parenthesis “(” and “)”
only. 07

Q.5 (a) When can we say that the language is decidable or undecidable? 03
(b) Draw only the transition table of Turing Machine to accept the language 𝐿 = 04
{0𝑛 1𝑛 : 𝑤ℎ𝑒𝑟𝑒 𝑛 ≥ 1}
(c) Define: Bounded Minimalization and show that, if P is a primitive recursive (𝑛 + 07
1) place predicate, its bounded minimalization 𝑚𝑃 is a primitive recursive
function.
OR
Q.5 (a) When can the language be called a recursive language or a recursively enumerable 03
language?
(b) Show that a Turing Machine to recognize the language 𝐿 = 𝐿(0∗ 1) can accept 04
the string without moving the head in L direction.
(c) Define: 𝜇-Recursive functions and show how all computable functions are 𝜇 - 07
recursive.

Table-1 Table-2
𝛿(𝑞, 0) 𝛿(𝑞, 1) State 0 1 X Y B
𝑞0 {𝑞0 , 𝑞1 } {𝑞1 }
𝑞0 (𝑞1, 𝑋, 𝑅) (𝑞2, 𝑌, 𝑅) (𝑞6, 𝑋, 𝑅) (𝑞6, 𝑌, 𝑅) (𝑞6, 𝐵, 𝑅)
𝑞1 {ø} {𝑞0 , 𝑞1 }
𝑞1 (𝑞1, 0, 𝑅) (𝑞1, 1, 𝑅) (𝑞3, 𝑋, 𝐿) (𝑞3, 𝑌, 𝐿) (𝑞3, 𝐵, 𝐿)

𝑞2 (𝑞2, 0, 𝑅) (𝑞2, 1, 𝑅) (𝑞4, 𝑋, 𝐿) (𝑞4, 𝑌, 𝐿) (𝑞4, 𝐵, 𝐿)

𝑞3 (𝑞5, 𝑋, 𝐿) — (𝑞6, 𝑋, 𝑅) (𝑞6, 𝑌, 𝑅) —

𝑞4 — (𝑞5, 𝑌, 𝐿) (𝑞6, 𝑋, 𝑅) (𝑞6, 𝑌, 𝑅) —

𝑞5 (𝑞5, 0, 𝐿) (𝑞5, 1, 𝐿) (𝑞0, 𝑋, 𝑅) (𝑞0, 𝑌, 𝑅) —

Figure-1

=======xx===========xxxxxxxxxxx=======xx======xxxxxxxxxx=============xx=====