CS 310: Section 7.1
Name: .
Section 7.1: Measuring Complexity
These exercises reect material from our text, Introduction to the Theory of Computation, by Michael
Sipser, PWS Publishing Co., 1997.
Denitions
Dene each of the following concepts:
(a) Time com
CS 310: Section 7.3
Name: .
Section 7.3: Cliques
These exercises reect material from our text, Introduction to the Theory of Computation, by Michael
Sipser, PWS Publishing Co., 1997.
Basic Concepts
Dene each of the following concepts:
(a) P
(b) N P
(c) Un
CS 310: Section 1.1
Name: .
Section 1.1: Finite Automata
These exercises reect material from our text, Introduction to the Theory of Computation, by Michael
Sipser, PWS Publishing Co., 1997.
Denitions
Dene each of the following concepts:
(a) Finite automa
CS 310: Section 1.2
Name: .
Section 1.2: Nondeterministic Finite Automata
These exercises reect material from our text, Introduction to the Theory of Computation, by Michael
Sipser, PWS Publishing Co., 1997.
Denitions
Dene each of the following concepts:
CS 310: Section 2.2
Name: .
Section 2.2: Pushdown Automata
These exercises reect material from our text, Introduction to the Theory of Computation, by Michael
Sipser, PWS Publishing Co., 1997.
Denitions
Dene each of the following concepts:
(a) Pushdown au
CS 310: Sections 7.4-5
Name: .
Sections 7.4-5: The Class NPC
These exercises reect material from our text, Introduction to the Theory of Computation, by Michael
Sipser, PWS Publishing Co., 1997.
Basic Concepts
Dene the following concept:
(a) N P C
The Cla
CS 310: Section 1.4
Name: .
Section 1.4: Non-regular Languages and the Pumping Lemma
These exercises reect material from our text, Introduction to the Theory of Computation, by Michael
Sipser, PWS Publishing Co., 1997.
Denitions
Dene each of the following
CS 310: Section 2.1
Name: .
Section 2.1: Context-free Grammars
These exercises reect material from our text, Introduction to the Theory of Computation, by Michael
Sipser, PWS Publishing Co., 1997.
Denitions
Dene each of the following concepts:
(a) Context
CS 310: Sections 8.1-3
Name: .
Sections 8.1-3: Complexity
These exercises reect material from our text, Introduction to the Theory of Computation, by Michael
Sipser, PWS Publishing Co., 1997.
Basic Concepts
Dene the following concepts:
(a) Space complexit
CS 310: Section 1.3
Name: .
Section 1.3: Regular Expressions
These exercises reflect material from our text, Introduction to the Theory of Computation, by Michael Sipser, PWS Publishing Co., 1997. Definitions Define each of the following concepts: (a) Reg
CS 310: Section 7.2
Name: .
Section 7.2: The Class P
These exercises reect material from our text, Introduction to the Theory of Computation, by Michael
Sipser, PWS Publishing Co., 1997, as well as Introduction to Algorithms, by Cormen, Leiserson, and Riv
CS 310: Sections 3.1-3.3
Name: .
Sections 3.1-3.3: Turing Machines
These exercises reect material from our text, Introduction to the Theory of Computation, by Michael
Sipser, PWS Publishing Co., 1997.
Denitions
Dene each of the following concepts:
(a) Tur
CS 310: Sections 4.14.2
Name: .
Sections 4.14.2: Decidability
These exercises reect material from our text, Introduction to the Theory of Computation, by Michael
Sipser, PWS Publishing Co., 1997.
Denitions
Dene each of the following concepts:
(a) Decidabl
CS 310: Section 7.3
Name: .
Section 7.3: The Class NP
These exercises reect material from our text, Introduction to the Theory of Computation, by Michael
Sipser, PWS Publishing Co., 1997, as well as Introduction to Algorithms, by Cormen, Leiserson, and Ri
CS 310: Section 9.3
Name: .
Sections 9.3: Circuit Complexity
These exercises reect material from our text, Introduction to the Theory of Computation, by Michael
Sipser, PWS Publishing Co., 1997.
Basic Concepts
Dene the following concepts:
(a) Oracle
(b) O