C.K.

PITHAWALA COLLEGE OF ENGINEERING & TECHNOLOGY, SURAT

GUJARAT TECHNOLOGICAL UNIVERSITY

COMPUTER ENGINEERING DEPARTMENT

TUTORIAL
Name of Student

Enrollment No.

Subject Name THEORY OF COMPUTATION

Subject Code 3160704

Student Class 3rd Year (6th Semester)

Academic Year
2024-25
 COMPUTER ENGINEERING DEPARTMENT

C.K. PITHAWALA COLLEGE OF ENGINEERING AND TECHNOLOGY, SURAT

COs
Course Outcome (CO)
Students will be able to
Course CO Statement
Outcome
CO1 Use the concepts and techniques of discrete mathematics for theoretical computer
science.
CO2 Identify different formal languages and their relationship.
CO3 Classify and construct grammars for different languages and vice-versa.
CO4 Build finite automata, push down automata and turing machine.
CO5 Analyze various concepts of undecidability and Computable Function and Discuss
analytically and intuitively for problem-solving situation
 C.K. PITHAWALA COLLEGE OF ENGINEERING AND TECHNOLOGY, SURAT

COMPUTER ENGINEERING DEPARTMENT

Name of Student

Enrollment No.

Subject name with code THEORY OF COMPUTATION (3160704)

List of Assignment with CO Mapping

Assignment No. Title CO

1 Basics of mathematical theory concepts CO1

2 Regular, non regular and formal languages CO2
3 Context Free Grammar and Languages CO3
4 Push Down Automata and Turing Machines CO4
5 Theory of Computation in the computer field to solve CO5
computational problems

INDEX
Sr.No Title Date Grade Sign
1 Basics of mathematical theory concepts
2 Regular, non-regular and formal languages
3 Context Free Grammar and Languages
4 Push Down Automata and Turing Machines
5 Theory of Computation in the computer field to solve
computational problems

COMPUTER ENGINEERING DEPARTMENT, CKPCET, SURAT.

 Assignment –IV:
[Batch 1]
Q. No Questions (Total Marks: 10) Level of
Bloom’s
Taxonomy
Q.1 Define Push Down Automata (PDA). Design and draw a deterministic PDA U
accepting strings with more a’s than b’s. Trace it for the string “abbabaa”.

Q.2 Define Push Down Automata (PDA). Draw PDA accepting strings of U
Brackets like following.

S 🡪 SS | {S} | [S] | Λ

Q.3 Convert following CFG to PDA A

S → 0S1 | 00 | 11 0S
Q.4 Draw Turing Machine(TM) which recognizes words of the form { an bn cn | U
n≥ 1 }

Q.5 Explain Halting Problem. U

Q.6 Design a Turing Machine to copy strings. U

Q.7 Design Turing Machine(TM) to accept even Palindrome over {a,b}. U

[Batch 2]
Q. Questions (Total Marks: 10) Level of
Bloom’s
No
Taxonomy
Q.1 For the language L={set of strings over alphabet {a, b} with exactly twice as A
many a’s as b’s} design a PDA (Push Down Automata) and trace it for the
sring “abaabbaaaaabaab”

Q.2 For the language L={ ai bj ck | i, j, k ≥ 0 and i + j = k } design a PDA (Push A

Down Automata) and trace it for String “bbbbbccccc”
Q.3 Find CFG from given PDA that accepts the language {0 1 }. PDA is A

(Q, Σ, Г, δ, q, Z, F) where Q={q, r}, Σ = {0, 1}, Г = {Z, X}, δ is defined by:
 State Input Stack New State Stack

q 0 Z q XZ

q 0 X q XX

q 1 X r ^

r 1 X r ^

r ^ Z r ^

Q.4 Draw Turing Machine(TM) which recognizes words of the form { an bn cn | U

n≥ 1 }

Q.5 Write a Turing Machine to copy strings. U

Q.6 Write a Turing Machine to delete a symbol. A

Q.7 Explain Halting Problem. U

[Batch 3]
Q. No Questions (Total Marks: 10) Level of
Bloom’s
Taxonomy
Q.1 Write PDA for following languages: A

{ x ε { a,b}* | n a (x) < n b (x) }

Q.2 Prove: The language pal= { x ∈ {a, b}* | x = x r } cannot be accepted by U

any deterministic pushdown automaton.

Q.3 Design and draw a deterministic PDA accepting strings with more a’s U
than b’s. Trace it for

the string “abbabaa”.

Q.4 For the language L = { xcxr / x Є {a,b}* } (Palindrome with middle A

character=c), Design a PDA(Push Down Automata) and trace it for
string “abacaba”.
Q.5 Draw the TM to copy string and delete a symbol. U
Q.6 Write short note on Church Turing Thesis U
 Q.7 Define Turing Machine. Draw a Turing Machine(TM) to accept A
Palindromes over {a,b}. (Even Palindromes)

[Batch 4]
Q. No Questions (Total Marks: 10) Level of
Bloom’s
Taxonomy
Q.1 Design and draw a deterministic PDA accepting strings of the language U

L = { x ∈{ a, b}* | n a (x) > n b (x) }. Trace it for the string “aababaab”.

Q.2 Write transition table for PDA recognizing following language: { ai bj ck | j = A

i or j = k }.
Q.3 Define Context Free Grammar (CFG). Describe the language accepted by A
following CFG: S → aSa | bSb | a | b | Λ
Q.4 For the language L = { xcx r / x Є {a,b}* } design a PDA(Push Down U
Automata) and trace it for string “bacab”.
Q.5 Write TM accepting even Palindrome. U
Q.6 Write short note on Church Turing Thesis R
Q.7 Draw Turing Machine(TM) which recognizes words of the form { an bn cn | U
n≥ 1 }