Theory of Computation
Lecture #1
Sarmad Abbasi
Virtual University
Sarmad Abbasi (Virtual University)
Theory of Computation
1/1
Lecture 1: Overview
The Story of Computation.
Theory of Computation.
Computability and Logic.
Complexity Theory.
Sarmad Abbasi (
Virtual University of Pakistan
CS701 Theory of Computation
Fall 12
Solution to Assignment 4
Instructions to Solve Assignments
The purpose of assignments is to give you hands on practice. It is expected that
students will solve the assignments themselves.
CS701 Theory of Computation
Assignment 1
ID : MS140400254
Name: Fayyaz Masood
Question 1
(15 + 15 = 30 Marks)
Design a Turing machine for each of the following languages, give formal description of the TM and
draw state diagram.
a) cfw_w | w contains more
CS701 Theory of Computation
Assignment # 2
MS(CS), Spring 2015
Presented By:
Name: Fayyaz Masood
ID: MS140400254
Question 1
Let T = cfw_<M> | M is a TM that accepts wR whenever it accepts w. Show that T is undecidable.
wR: w written backwards (e.g. if w =
www.VUSR.net
Virtual University of Pakistan
Fall 09
CS701 Theory of Computation
Assignment No. 1
Instructions to Solve Assignments
The purpose of the assignments is to give you hands on practice. It is expected that students will solve the
assignments the
www.VUSR.net
Virtual University of Pakistan
Fall 09
Solution Assignment No. 1
Question No. 1
Design a Turing Machine for each of the following languages, give formal description of the TM and draw
state diagram:
a)
cfw_0
3n
| n 0 , the language consistin
CS701: Theory of Computation
Quiz No. 1
Date: 30 Jan. 2008
Deadline:1 Feb, 2008
Note: Listen Lecture No. 23, 24, 25 to solve this quiz.
Instructions to Solve Assignment
The purpose of the quiz is to give you a review of studied lectures. It is expected th
1
CS-701 Theory of Computation
Theory of Computation
Chapter
1
2
3
4
5
6
7
Subject
The Church Turing Thesis
Decidability
Reducibility
Advance Topics in Computability Theory
Time Complexity
Space Complexity
Computability
Lecture
01 to 06
07 to 09
10 to 14
DO NT FORGET TO SHARE YOUR CURRENT MID TERM PAPERS AT http:/mscsvu.blogspot.com.
DONT FORGET TO VIEW CURRENT MIDTERM EXAM PAPERS AT http:/mscsvu.blogspot.com.
You can Post your paper any where on this site. I shall put at correct place related to course.
Question 1 (17 Marks)
Let LONG-PATH = cfw_<G, a, b, k> | G is an undirected graph and contains a simple path of length at
least k from a to b. Show that LONG-PATH is NP-complete.
Question 2 (17 Marks)
Let DSAT = cfw_<> | is a Boolean formula and has at le
44 Theory of Computation
_._-
5.23 First, let P be the language {(M)| M is a TM with 5 states}. P is non-
trivial, and so it satises the second condition of Rices Theorem but P
can be easily decided by checking the number of states of the input Turing
Mac
Virtual University of Pakistan
CS701 Theory of Computation
Fall 12
Solution to Assignment 3
Instructions to Solve Assignments
The purpose of assignments is to give you hands on practice. It is expected that
students will solve the assignments themselves.
Virtual University of Pakistan
Fall 12
CS701 Theory of Computation
Solution to Assignment 1
Instructions to Solve Assignments
The purpose of assignments is to give you hands on practice. It is expected that
students will solve the assignments themselves.
Virtual University of Pakistan
Spring 2016
CS701 Theory of Computation
Assignment 3
Instructions to Solve Assignments
The purpose of the assignments is to give students hands on practice. It is expected that
students will solve assignments themselves. Fol
Virtual University of Pakistan
Spring 2016
Solution Idea Assignment 2
Question 1
(14 Marks)
Let 3-CLIQUE = cfw_<G, 3> | G is an undirected graph with a 3-clique. Show that 3CLIQUE P.
Solution:
Let G = (V, E) be a graph with set of vertices V and set of ed
Virtual University of Pakistan
Spring 2016
Solution Idea Assignment 1
Question 1
(18 + 18 = 36 Marks)
Design a Turing machine for each of the following languages. First, give a high level description of
the Turing machine (8 marks) then give formal descri
Theory Of Computation MCQ - Context free
languages
1. Home
2. Computer Science MCQ
3. Theory Of Computation MCQ
4. Context free languages
1:
Correct hierarchical relationship among context- free, right-linear, and context-sensitive
language is
A context-f
All in One - CS701 - Final Papers - Spring 2015 [Solutions]
By: Muhammad Asif Mansoor MSCS VU
-[CS701 - Paper 1 - Spring 2015]
Question 1:
Let SET-SPLITTING = cfw_hS,Ci| S is a finite set and C = cfw_C1, . . . ,Ck is a collection of subsets of S, for
some
An Easier Way to Understand the Undecidability of
Halting Problem of Turing Machines
Muhammad Mustafa
MS120400114, Virtual University of Pakistan
Mustafa8584@gmail.com
Abstract This paper provides us an easier way to understand
the undecidability of halti
Total questions were 7
1 Q MCQs having 15 parts (Very tricky)
6 Qs Theory
Theory questions I remember are as follows:
1. Why is it difficult to prove that P = NP or P NP? Do you think P is equal to NP or not.
Elaborate.
2. Let DOUBLESAT= cfw_<> | has at l
www.VUSR.net
Virtual University of Pakistan
Fall 09
Solution Assignment 2
Question No. 1
a. Prove that Every k-head TM has an equivalent single head TM.
Proof:
Let M be a k-head TM. We construct an equivalent single head TM S. The tape alphabet of S conta
Virtual University of Pakistan
Fall 11
Solution Assignment 1
Question No. 1
Design a Turing machine for each of the following languages, give formal description of
the TM and draw state diagram.
a) cfw_w | w does not contain twice as many 0s as 1s over th
Q.1
EMPTINESS problem for LBA is decidable?
1.
TRUE
2.
FALSE
Q.2 A property that holds for almost all strings also hold incompressible
strings ?
1.
TRUE
2.
FALSE
Q3.
For a TM M and string w
History M on w. Then
CH M ,w
Let CH M ,w
=cfw_x|x is an acceptabl
Cs 701 assign
UN-DECIDABILITY OF HALTING PROBLEMS OF TURING MACHINES
Let ATM be a language such that ATM = cfw_<M, w> | where M is a Turing machine that accepts string w. M will accept w if M,
after running on w, reaches its accepting state. M will reject
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 25, 675-686 (2009)
Toward a Ubiquitous Smart Space Design Framework*
TAYSHENG JENG
Department of Architecture
National Cheng Kung University
Tainan, 701 Taiwan
In this paper, a design framework is presented f