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 machines.
CO5 Analyze various concepts of undecidability and Computable Function and Discuss
analytically and intuitively for problem-solving situation

Program Specific Outcome (PSO)

Students will be able to

Program Specific PSO Statement

Outcome

PSO1 Students will be able to analyze, innovate and design systems to solve
real world engineering challenges by applying the concepts of computer
engineering.

PSO2 Students will have the professional capabilities and adaptation of recent
trends in computer engineering for the betterment of society.
 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 Tutorial 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.
Theory of Computation
Tutorial –I:
[Batch1]
Q. No Questions (Total Marks: 10) Level of
Bloom’s
Taxonomy
Q.1 Define one-to-one, onto and bijection function. RU

Check whether the function f: R ---> R+, f(x) = x2 is one to one and onto.

Q.2 What do you mean by recursive definition? Give the recursive definition of R
factorial.

Q.3 Using Principle of Mathematical Induction, Prove that for every n ≥ 1, 1 + 3 UA

+ 5 + … + (2n - 1) = n^2

Q.4 Prove “There must be a prime number between n and n! UA

Q.5 Define following with examples UA

1. Set
2. Subset
 [Batch 2]

Q. No Questions (Total Marks: 10) Level of

Bloom’s
Taxonomy
Q.1 Define Mathematical Induction Principle and Prove that for every n ≥ 0, RUA

Σ i = n (n+1) / 2

i=0

Q.2 Check the equivalence for following relation over the set {1,2,3} along UA
with justification for each:

{(1,1) ,(2,2), (3,3)}

{(1,1), (2,1), (2,2), (1,2), (3,3)}

Q.3 In each case below, construct a truth table for the statement UA

a. (p → q) ∧ (p → ¬q)

b. p ∨ (p → q)

Q.4 Define One-to-one and Onto Functions. Also explain Compositions and R U
Inverse of functions.

Q.5 Define the Strong Principle of Mathematical Induction. Prove the R U A

following using mathematical Induction.

7+ 13 + 19 + .........+ (6n+1) = n (3n+4)

 [Batch 3]
Q. No Questions (Total Marks: 10) Level of
Bloom’s
Taxonomy
Q.1 Prove that √2 (square root of 2) is Irrational by method of Contradiction. UA

Q.2 Explain one-to-one, onto and bijection functions with suitable examples. RU
Q.3 Prove that : The Product to two integer Odd numbers is ODD UA

Q.4 Show that 2n> n3 for n >10 by Mathematical Induction. UA

Q.5 Explain Tautology and Contradiction in terms of logic U

 [Batch 4]

Q. No Questions (Total Marks: 10) Level of

Bloom’s
Taxonomy
Q.1 Answer the following RUA

1. In the given relation determine the properties(reflexivity, symmetry,

transitivity), which ones the relation has: R = {(1,1),(2,2),(3,3),(1,2)}
and R = Ø

2. Show that for any language L, L* = (L*)* = (L+ ) * = (L*)+

3. Give the definition of “Transitive Closure of a Relation” using

induction.

Q.2 Prove that √2 (square root of 2) is Irrational by method of U A

Contradiction.
Q.3 State Surjective and Inverse function along with Example RU

Q.4 Prove: For every three positive integers i, j, and n, if ij = n, then i ≤ √n or j UA

≤ √n.
Q.5 What do you mean by Equivalence Relation? Write Same for following UA
set : { a,b,c,d}
 Tutorial –II:
[Batch 1]
Q. No Questions (Total Marks: 10) Level of
Bloom’s
Taxonomy
Q.1 Draw FAs recognizing the following languages UN

L 1 = {x / 00 is not a substring of x }
L 2 = {x / x ends with 01 }

(1) L1 - L2 (2) L1∩L2

Q.2 Write Regular Expressions for following U

(i) The language of all strings in {0,1}* that do not end with 11.

(ii) The language of all strings containing both 101 and 010 as substrings.

(iii) Strings with length 6 or less in {a,b}.

Q.3 Draw Finite Automata to accept following. U

(i) Strings that ends in 11 or 10.

(ii) Strings of the language in {0,1}* with odd no. of zeroes and odd no. of
ones.
Q.4 State and Prove Kleene’s Theorem Part 1 with illustration. UN
Q.6 Explain procedure to minimize finite automata RU
Q.7 Convert following NFA- Λ to NFA and FA. UA

Q δ(q, ^) δ(q, 0) δ(q, 1)

A {B, D} {A} Ø

B Ø {C} {E}

C Ø Ø {B}

D Ø {E} {D}

E Ø Ø Ø
Q.8 Find a regular expression corresponding to each of the following subsets of U
{0, 1}*.

i. The language of all strings that do not contain the substring 110.

ii. The language of all strings containing both 101 and 010 as substrings.

iii. The language of all strings in which both the number of 0's and the
number of l's are odd.

Q.9 Prove: The language accepted by any finite automaton is regular. U

Q.10 Give the minimum pumping length and justify your answer. 0001∗ UN

[Batch 2]

Q. No Questions (Total Marks: 10) Level of

Bloom’s
Taxonomy
Q.1 For each of the following regular expressions, draw an FA recognizing the U
corresponding language.

i. 1(01 + 10)* + 0(11 + 10)*

ii. (010 + 00)*(10)*

Q.2 Let M1, M2 and M3 be the FAs pictured in Figure below, recognizing U N
languages L1, L2 and L3 respectively.

Draw FAs recognizing the following languages.

i. L 1 U L 2
 ii. L 1 ∩ L 2

iii. L 1 - L 2

iv. L 1 ∩ L 3

v. L 3 - L 2

Q.3 Use the pumping lemma to show that the following languages are not UA
regular :

{www| w ∈ {a, b}∗}

Q.4 Prove: The language accepted by any finite automaton is regular. UA

Q.5 Convert NFA-^ to NFA and DFA. Initial State: A , Final State: D UA

Q δ(q, ^) δ(q, 0) δ(q, 1)

A {B} {A} Ø

B {D} {C} Ø

C Ø Ø {B}

D Ø {D} Ø

Q.6 State Equivalence Theorem for DFA UA

Q.7 Write Regular Expressions for following U

(i) The language of all strings in {0,1}* that do not end with 11.

(ii) The language of all strings containing both 101 and 010 as substrings.

(iii) Strings with length 6 or less in {a,b}.

Q.8 Write Regular Expression and draw FA for the following languages. U

(i) {w | w contains at least three 1s}

(ii) {w | w starts and ends with the same symbol}

Q.9 Attempt the following: UA

1) Design a FA from given regular expression 10 + (0 + 11)0* 1.

2) Write a Regular Expression for the String of 0’s and 1’s in which number
of 0’s and 1’s are even.
Q. 10 Minimize the following DFA (Using Equivalence Theorem and Table Filling UN
Method).

[Batch 3]
Q. No Questions (Total Marks: 10) Level of
Bloom’s
Taxonomy
Q.1 Attempt the following : U

1) Draw FA for (a + b)* baaa.

2) Write a Regular Expression for the String of 0’s and 1’s in which
number of 0’s and 1’s are even.

Q.2 Write Regular Expressions for the following languages of all strings in U
{0,1}*

(i) Strings that start with 1 and do not end with 10.

(ii) Strings with length 6 or less.

Q.3 Compare FA, NFA and NFA- Λ. U

For the following Regular Expression draw an NFA-Λ recognizing the

corresponding language.

(0 + 1) * (10+110) * 1
Q.4 Draw FA for accepting: U

(i)The string in {0,1}* ending in 1 and not containing substring 00.

(ii)The strings with odd no. of 1’s and odd no. of 0’s
Q.5 Write theorem: For any NFA M =(Q,Σ,q0,A,δ) accepting a language L, there UA
 is an FAM1=(Q,Σ,q1,A1,δ1) that also accepts L.

Q.6 Convert following NFA- Λ to NFA and FA. UA

Q δ(q, ^) δ(q, 0) δ(q, 1)

A {B, D} {A} Ø

B Ø {C} {E}

C Ø Ø {B}

D Ø {E} {D}

E Ø Ø Ø

Q.7 Draw Finite Automata (FA) for following languages: U

L 1 = {x / 11 is not a substring of x, x Є {0,1}*}

L 2 = {x / x ends with 10, x Є {0,1}* }

Find FA accepting languages (i) L 2 – L 1 and (ii) L 1 ∩ L 2

Q.8 Answer the following: RU

1. Define regular language and regular expressions.

2. Find regular expression for the following:

Language of all string that do not end with 01.

3. Describe the language corresponding to following:

(1+01)*(0+01)*

Q.9 Answer the following UN

1.Draw FA for regular expression: (111+100)*0

2. Let M1 and M2 be the FA in fig below for the language L1 and L2,

find L1 U L2 and L1 ∩ L2.

Q. 10 Minimize the following DFA UN

[Batch 4]
Q. Questions (Total Marks: 10) Level of
Bloom’s
No
Taxonomy
Q.1 Write theorem: For any NFA M =(Q,Σ,q0,A,δ) accepting a language L, UA
there is an FAM1=(Q,Σ,q1,A1,δ1) that also accepts L.

Q.2 Write Kleene’s Theorem part-I, Any regular language can be accepted by R A
a finite automaton.
Q.3 Convert following NFA- Λ to NFA and FA. UA

Q δ(q, ^) δ(q, 0) δ(q, 1)

A {B, D} {A} Ø

B Ø {C} {E}

C Ø Ø {B}

D Ø {E} {D}

E Ø Ø Ø
Q.4 Answer the following: UA

1. Construct an NFA for r = (a|b)*a (Using Thompson’s Method)

2. State Pumping Lemma and its applications

Q.5 Write Regular Expressions for the following languages of all strings in U
{0,1}*

(i) Strings that contains odd number of 0’s (zeroes).

(ii) Strings that begin or end with 00 or 11.

Q.6 Write definition of finite automata and draw FA for the strings: RU

(i)The string in {0,1}* ending in 10 or 11.

(ii)The string corresponding to Regular expression {11} * {00} *

Q.7 Compare FA , NFA and NFA- Λ. For the following Regular Expression U
draw an NFA-Λ recognizing the corresponding language.

(0 + 1) * (10+01) * 11

Q.8 Draw Finite Automata (FA) for following languages: U

L 1 = {x / 11 is not a substring of x, x Є {0,1}*}

L 2 = {x / x ends with 10, x Є {0,1}* }

Find FA accepting languages (i) L 1 ∩ L 2 and (ii) L 1 – L 2

Q.9 Answer the following UN

1.Draw FA for regular expression: (111+100)*0

2. Let M1 and M2 be the FA in fig below for the language L1 and L2,

find L1 U L2 and L1 ∩ L2.

Q.10 Minimize the following DFA (Using Table Filling Method) UN