BSCS1201-THECOMP

Theory of Computation (With Automata Theory)

Course Syllabus
Course Code: THECOMP

Serial Number: F0093

Course Title: Theory of Computation With Automata Theory

Course Description: This course covers finite automata, non-deterministic sutomata, regular expressions,
context-free grammar, pushdown automata, CFG-PDA, context-free languages, turing
machines.

Credit: 3 units (3 hours lecture per week)

Prerequisites: DISTRUC - Discrete Structures

References: 1 Sipser, Michael, Introduction to the theory of computation (2nd Ed.)

2 Hopcroft and Ullman, Introduction to automata theory, languages and computations
3 Cohen, Daniel, Introduction to computer theory
4 Denning, Dennis, and Qualitz, Machines, languages, and computation
5 Hopcroft, J.E., Motwani, R., Ullman, J.D., (2000), Introduction to automata theory ,
languages and computation (1st, 2nd eds.), Addison Wesley
6 Kozen, Dexter C., (1999), Automata and computability , Springer
7 Ding-Zhu Du & Ker-I Ko, (2000), Theory of computational complexity , Wiley-
Interscience
8 Hromkovic, Juraj, (2003), Theoretical computer science : introduction to automata,
computability, complexity, algorithmics, randomization, communication, and
cryptography , Springer
9 Martin, John, (2002), Introduction to languages and theory of computer (3rd ed.),
McGraw-Hill

Course Requirements: 1 Class discussions

2 Exercises
3 Assignments and quizzes
4 Major exams

Grading System:

The following percentage distribution shall be followed:

Prelims 20%
Midterms 20%
Prefinals 20%
Finals 40%
100%

The following are the required periodic grade components for this course:

Class Participation 10%

Quizzes 20%
Exercises 20%
Periodical Examination 50%
100%

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 1 of 3
 BSCS1201-THECOMP01
Theory of Computation with Automata Theory

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

1 Recall the different thoeries and 1 1 1 Course Orientation/Review of Set 1-26 1-15
concepts regarding sets. Theory
2 Describe functions and relations 2 1 Functions and Relations
3 Discuss the graphs, strings, and 3 1 Graps/Strings and Languages
languages.
4 Identify the appropriate method to use in 2 4 1 Types of Proofs
proving diffferent theorems and lemmas.

5 1 Types of Proofs
5 Discuss the formal definition of finite 6 1 Introduction to Finite Automata
automata.
3 7 1 Introduction to Finite Atuomata
6 Apply the different techniques in 8 1 Designing Finite Automata
desgining a finite automaton that can
accept a given string.
9 1 Designing Finite Automata
7 Explain the regular operations that can 4 10 1 The Regular Operations
be performed on strings.
11 1 The Regular Operations
8 Discuss the formal definition of 12 1 Nondeterminism
nondeterministic finite automata.
5 13 1 Nondeterminism
14 2 PRELIMINARY EXAMINATION
9 Convert any given NFA into its equivalent 6 15 1 Equivalnece of NFAs and DFAs
DFA.
16 1 Equivalence of NFAs and DFAs
10 Use nondeterminism to prove closure 17 1 Closure Under The Regular
under the regular operations. Operations

7 18 1 Closure Under The Regular

Operations
11 Describe what regular expressions are. 19 1 Regular Expressions

12 Convert a regular expression into its 20 1 Equivalence of Regular Expressions

equivalent NFA. and Finite Automata
8 21 1 Equivalence of Regular Expressions
and Finite Automata
22 1 Equivalence of Regular Expressions
and Finite Automata
13 Explain what nonregular languages are. 23 1 Nonregular Langugaes

9 24 1 Non-regular Languages
14 Use the pumping lemma to prove 25 1 The Pumping Lemma
nonregularity in languages.
26 1 The Pumping Lemma
10 27 1 The Pumping Lemma
28 2 MIDTERM EXAMINATION
15 Describe context-free grammars as more 11 29 1 Context-Free Grammars
powerful tool of describing languages.

30 1 Context-Free Grammars
16 Design a CFG for any given language. 31 1 Designing Context-Free Grammars

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 2 of 3
 BSCS1201-THECOMP01
Theory of Computation with Automata Theory

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

17 Define ambiguity as usedin context-free 12 32 1 Ambiguity
grammars.
18 Convert any CFG into its Chomsky 33 1 Chomsky Normal Form
Normal Form
34 1 Chomsky Normal Form
13 35 1 Chomsky Normal Form
19 Discuss pushdown automata as a tool in 36 1 Pushdown Automata
proving that a language is context-free.

37 1 Pushdown Automata
14 38 1 Pushdown Automata
39 2 PREFINAL EXAMINATION
20 Construct a PDA from any given CFG. 15 40 1 Equivalence pf Pushdown Automata
with Context-Free Grammars

41 1 Equivalence pf Pushdown Automata

with Context-Free Grammars

21 Describe non-context-free languages. 42 1 Non-Context Free Languages

23 Discuss turing machines as powerful 16 43 1 Turing Machines

modelling tools.
44 1 Turing Machines
24 Explain alternative definitions of turing 45 1 Variants of Turing Machines
machines.
17 46 1 Variants of Turing Machines
47 1 Variants of Turing Machines
25 Explain the use of turing machines for 48 1 Algorithms and Turing Machines
modelling algorithms.
18 49 1 Algorithms and Turing Machines
50 2 FINAL EXAMINATION

Reference books:
1 Sipser, Michael, Introduction to the theory of computation (2nd Ed.)
2 Hopcroft and Ullman, Introduction to automata theory, languages and computations
3 Cohen, Daniel, Introduction to computer theory
4 Denning, Dennis, and Qualitz, Machines, languages, and computation
5 Hopcroft, J.E., Motwani, R., Ullman, J.D., (2000), Introduction to automata theory ,
6 Kozen, Dexter C., (1999), Automata and computability , Springer
7 Ding-Zhu Du & Ker-I Ko, (2000), Theory of computational complexity , Wiley-
8 Interscience
Hromkovic, Juraj, (2003), Theoretical computer science : introduction to automata,
9 computability,
Martin, complexity,
John, (2002), algorithmics,
Introduction randomization,
to languages communication,
and theory of computer and
(3rd ed.),
McGraw-Hill

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 3 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

1 Recall the different thoeries and 1 1 1 Course Orientation/Review of Set 1-26 1-15
concepts regarding sets. Theory
2 Describe functions and relations 2 1 Functions and Relations
3 Discuss the graphs, strings, and 3 1 Graphs 1-14 1-10
languages.
2 4 1 Graphs/Strings and Languages 1-9 1-6
4 Identify the appropriate method to use in 5 1 Types of Proofs 1-27 1-15
proving diffferent theorems and lemmas.

6 1 Types of Proofs
5 Discuss the formal definition of finite 3 7 1 Introduction to Finite Atuomata
automata.
6 Apply the different techniques in 8 1 Designing Finite Automata
desgining a finite automaton that can
accept a given string.
9 1 Designing Finite Automata
7 Explain the regular operations that can 4 10 1 The Regular Operations
be performed on strings.
11 1 The Regular Operations
8 Discuss the formal definition of 12 1 Nondeterminism
nondeterministic finite automata.
5 13 1 Nondeterminism
14 2 PRELIMINARY EXAMINATION
9 Convert any given NFA into its equivalent 6 15 1 Equivalnece of NFAs and DFAs
DFA.
16 1 Equivalence of NFAs and DFAs
10 Use nondeterminism to prove closure 17 1 Closure Under The Regular
under the regular operations. Operations

7 18 1 Closure Under The Regular

Operations
11 Describe what regular expressions are. 19 1 Regular Expressions

12 Convert a regular expression into its 20 1 Equivalence of Regular Expressions

equivalent NFA. and Finite Automata
8 21 1 Equivalence of Regular Expressions
and Finite Automata
22 1 Equivalence of Regular Expressions
and Finite Automata
13 Explain what nonregular languages are. 23 1 Nonregular Langugaes

9 24 1 Non-regular Languages
14 Use the pumping lemma to prove 25 1 The Pumping Lemma
nonregularity in languages.
26 1 The Pumping Lemma
10 27 1 The Pumping Lemma
28 2 MIDTERM EXAMINATION
15 Describe context-free grammars as more 11 29 1 Context-Free Grammars
powerful tool of describing languages.

30 1 Context-Free Grammars
16 Design a CFG for any given language. 31 1 Designing Context-Free Grammars

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 2 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

17 Define ambiguity as usedin context-free 12 32 1 Ambiguity
grammars.
18 Convert any CFG into its Chomsky 33 1 Chomsky Normal Form
Normal Form
34 1 Chomsky Normal Form
13 35 1 Chomsky Normal Form
19 Discuss pushdown automata as a tool in 36 1 Pushdown Automata
proving that a language is context-free.

37 1 Pushdown Automata
14 38 1 Pushdown Automata
39 2 PREFINAL EXAMINATION
20 Construct a PDA from any given CFG. 15 40 1 Equivalence pf Pushdown Automata
with Context-Free Grammars

41 1 Equivalence pf Pushdown Automata

with Context-Free Grammars

21 Describe non-context-free languages. 42 1 Non-Context Free Languages

23 Discuss turing machines as powerful 16 43 1 Turing Machines

modelling tools.
44 1 Turing Machines
24 Explain alternative definitions of turing 45 1 Variants of Turing Machines
machines.
17 46 1 Variants of Turing Machines
47 1 Variants of Turing Machines
25 Explain the use of turing machines for 48 1 Algorithms and Turing Machines
modelling algorithms.
18 49 1 Algorithms and Turing Machines
50 2 FINAL EXAMINATION

Reference books:
1 Sipser, Michael, Introduction to the theory of computation (2nd Ed.)
2 Hopcroft and Ullman, Introduction to automata theory, languages and computations
3 Cohen, Daniel, Introduction to computer theory
4 Denning, Dennis, and Qualitz, Machines, languages, and computation
5 Hopcroft, J.E., Motwani, R., Ullman, J.D., (2000), Introduction to automata theory ,
6 Kozen, Dexter C., (1999), Automata and computability , Springer
7 Ding-Zhu Du & Ker-I Ko, (2000), Theory of computational complexity , Wiley-
8 Interscience
Hromkovic, Juraj, (2003), Theoretical computer science : introduction to automata,
9 computability,
Martin, complexity,
John, (2002), algorithmics,
Introduction randomization,
to languages communication,
and theory of computer and
(3rd ed.),
McGraw-Hill

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 3 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

1 Recall the different thoeries and 1 1 1 Course Orientation/Review of Set 1-26 1-15
concepts regarding sets. Theory
2 Describe functions and relations 2 1 Functions and Relations
3 Discuss the graphs, strings, and 3 1 Graphs 1-14 1-10
languages.
2 4 1 Graphs/Strings and Languages 1-9 1-6
4 Identify the appropriate method to use in 5 1 Types of Proofs 1-27 1-15
proving diffferent theorems and lemmas.

6 1 Types of Proofs
5 Discuss the formal definition of finite 3 7 1 Introduction to Finite Atuomata 1-25 1-14
automata.
8 1 Introduction to Finite Atuomata
6 Apply the different techniques in 9 1 Designing Finite Automata 1-29 1-16
desgining a finite automaton that can
accept a given string.
7 Explain the regular operations that can 4 10 1 Designing Finite Automata
be performed on strings.
11 1 The Regular Operations
8 Discuss the formal definition of 12 1 Nondeterminism
nondeterministic finite automata.
5 13 1 Nondeterminism
14 2 PRELIMINARY EXAMINATION
9 Convert any given NFA into its equivalent 6 15 1 Equivalnece of NFAs and DFAs
DFA.
16 1 Equivalence of NFAs and DFAs
10 Use nondeterminism to prove closure 17 1 Closure Under The Regular
under the regular operations. Operations

7 18 1 Closure Under The Regular

Operations
11 Describe what regular expressions are. 19 1 Regular Expressions

12 Convert a regular expression into its 20 1 Equivalence of Regular Expressions

equivalent NFA. and Finite Automata
8 21 1 Equivalence of Regular Expressions
and Finite Automata
22 1 Equivalence of Regular Expressions
and Finite Automata
13 Explain what nonregular languages are. 23 1 Nonregular Langugaes

9 24 1 Non-regular Languages
14 Use the pumping lemma to prove 25 1 The Pumping Lemma
nonregularity in languages.
26 1 The Pumping Lemma
10 27 1 The Pumping Lemma
28 2 MIDTERM EXAMINATION
15 Describe context-free grammars as more 11 29 1 Context-Free Grammars
powerful tool of describing languages.

30 1 Context-Free Grammars
16 Design a CFG for any given language. 31 1 Designing Context-Free Grammars

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 2 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

17 Define ambiguity as usedin context-free 12 32 1 Ambiguity
grammars.
18 Convert any CFG into its Chomsky 33 1 Chomsky Normal Form
Normal Form
34 1 Chomsky Normal Form
13 35 1 Chomsky Normal Form
19 Discuss pushdown automata as a tool in 36 1 Pushdown Automata
proving that a language is context-free.

37 1 Pushdown Automata
14 38 1 Pushdown Automata
39 2 PREFINAL EXAMINATION
20 Construct a PDA from any given CFG. 15 40 1 Equivalence pf Pushdown Automata
with Context-Free Grammars

41 1 Equivalence pf Pushdown Automata

with Context-Free Grammars

21 Describe non-context-free languages. 42 1 Non-Context Free Languages

23 Discuss turing machines as powerful 16 43 1 Turing Machines

modelling tools.
44 1 Turing Machines
24 Explain alternative definitions of turing 45 1 Variants of Turing Machines
machines.
17 46 1 Variants of Turing Machines
47 1 Variants of Turing Machines
25 Explain the use of turing machines for 48 1 Algorithms and Turing Machines
modelling algorithms.
18 49 1 Algorithms and Turing Machines
50 2 FINAL EXAMINATION

Reference books:
1 Sipser, Michael, Introduction to the theory of computation (2nd Ed.)
2 Hopcroft and Ullman, Introduction to automata theory, languages and computations
3 Cohen, Daniel, Introduction to computer theory
4 Denning, Dennis, and Qualitz, Machines, languages, and computation
5 Hopcroft, J.E., Motwani, R., Ullman, J.D., (2000), Introduction to automata theory ,
6 Kozen, Dexter C., (1999), Automata and computability , Springer
7 Ding-Zhu Du & Ker-I Ko, (2000), Theory of computational complexity , Wiley-
8 Interscience
Hromkovic, Juraj, (2003), Theoretical computer science : introduction to automata,
9 computability,
Martin, complexity,
John, (2002), algorithmics,
Introduction randomization,
to languages communication,
and theory of computer and
(3rd ed.),
McGraw-Hill

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 3 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

1 Recall the different thoeries and 1 1 1 Course Orientation/Review of Set 1-26 1-15
concepts regarding sets. Theory
2 Describe functions and relations 2 1 Functions and Relations
3 Discuss the graphs, strings, and 3 1 Graphs 1-14 1-10
languages.
2 4 1 Graphs/Strings and Languages 1-9 1-6
4 Identify the appropriate method to use in 5 1 Types of Proofs 1-27 1-15
proving diffferent theorems and lemmas.

6 1 Types of Proofs
5 Discuss the formal definition of finite 3 7 1 Introduction to Finite Atuomata 1-25 1-14
automata.
8 1 Introduction to Finite Atuomata
6 Apply the different techniques in 9 1 Designing Deterministic Finite 1-29 1-16
desgining a finite automaton that can Automata
accept a given string.
7 Explain the regular operations that can 4 10 1 Designing Deterministic Finite
be performed on strings. Automata
8 Discuss the formal definition of 11 1 Nondeterministic Finite Automata
nondeterministic finite automata.
12 1 Nondeterministic Finite Automata
9 Convert any given NFA into its equivalent 5 13 1 Equivalence of NFAs and DFAs
DFA.
14 2 PRELIMINARY EXAMINATION
6 15 1 Equivalence of NFAs and DFAs
16 1 The Regular Operations on
Languages
10 Use nondeterminism to prove closure 17 1 The Regular Operations on
under the regular operations. Languages

11 Describe what regular expressions are. 7 18 1 Regular Expressions

19 1 Regular Expressions
12 Convert a regular expression into its 20 1 Equivalence of Regular Expressions
equivalent NFA. and Finite Automata
8 21 1 Equivalence of Regular Expressions
and Finite Automata
22 1 Equivalence of Regular Expressions
and Finite Automata
13 Explain what nonregular languages are. 23 1 Nonregular Languages

9 24 1 Non-regular Languages
14 Use the pumping lemma to prove 25 1 The Pumping Lemma
nonregularity in languages.
26 1 The Pumping Lemma
10 27 1 The Pumping Lemma
28 2 MIDTERM EXAMINATION
15 Describe context-free grammars as more 11 29 1 Context-Free Grammars
powerful tool of describing languages.

30 1 Context-Free Grammars
16 Design a CFG for any given language. 31 1 Designing Context-Free Grammars

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 2 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

17 Define ambiguity as usedin context-free 12 32 1 Ambiguity
grammars.
18 Convert any CFG into its Chomsky 33 1 Chomsky Normal Form
Normal Form
34 1 Chomsky Normal Form
13 35 1 Chomsky Normal Form
19 Discuss pushdown automata as a tool in 36 1 Pushdown Automata
proving that a language is context-free.

37 1 Pushdown Automata
14 38 1 Pushdown Automata
39 2 PREFINAL EXAMINATION
20 Construct a PDA from any given CFG. 15 40 1 Equivalence pf Pushdown Automata
with Context-Free Grammars

41 1 Equivalence pf Pushdown Automata

with Context-Free Grammars

21 Describe non-context-free languages. 42 1 Non-Context Free Languages

23 Discuss turing machines as powerful 16 43 1 Turing Machines

modelling tools.
44 1 Turing Machines
24 Explain alternative definitions of turing 45 1 Variants of Turing Machines
machines.
17 46 1 Variants of Turing Machines
47 1 Variants of Turing Machines
25 Explain the use of turing machines for 48 1 Algorithms and Turing Machines
modelling algorithms.
18 49 1 Algorithms and Turing Machines
50 2 FINAL EXAMINATION

Reference books:
1 Sipser, Michael, Introduction to the theory of computation (2nd Ed.)
2 Hopcroft and Ullman, Introduction to automata theory, languages and computations
3 Cohen, Daniel, Introduction to computer theory
4 Denning, Dennis, and Qualitz, Machines, languages, and computation
5 Hopcroft, J.E., Motwani, R., Ullman, J.D., (2000), Introduction to automata theory ,
6 Kozen, Dexter C., (1999), Automata and computability , Springer
7 Ding-Zhu Du & Ker-I Ko, (2000), Theory of computational complexity , Wiley-
8 Interscience
Hromkovic, Juraj, (2003), Theoretical computer science : introduction to automata,
9 computability,
Martin, complexity,
John, (2002), algorithmics,
Introduction randomization,
to languages communication,
and theory of computer and
(3rd ed.),
McGraw-Hill

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 3 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

1 Recall the different thoeries and 1 1 1 Course Orientation/Review of Set 1-26 1-15
concepts regarding sets. Theory
2 Describe functions and relations 2 1 Functions and Relations
3 Discuss the graphs, strings, and 3 1 Graphs 1-14 1-10
languages.
2 4 1 Graphs/Strings and Languages 1-9 1-6
4 Identify the appropriate method to use in 5 1 Types of Proofs 1-27 1-15
proving diffferent theorems and lemmas.

6 1 Types of Proofs
5 Discuss the formal definition of finite 3 7 1 Introduction to Finite Atuomata 1-25 1-14
automata.
8 1 Introduction to Finite Atuomata
6 Apply the different techniques in 9 1 Designing Deterministic Finite 1-29 1-16
desgining a finite automaton that can Automata
accept a given string.
7 Explain the regular operations that can 4 10 1 Designing Deterministic Finite
be performed on strings. Automata
8 Discuss the formal definition of 11 1 Nondeterministic Finite Automata 1-33 1-18
nondeterministic finite automata.
12 1 Nondeterministic Finite Automata
9 Convert any given NFA into its equivalent 5 13 1 Equivalence of NFAs and DFAs 1-21 1-13
DFA.
14 2 PRELIMINARY EXAMINATION
6 15 1 Equivalence of NFAs and DFAs
16 1 The Regular Operations on
Languages
10 Use nondeterminism to prove closure 17 1 The Regular Operations on
under the regular operations. Languages

11 Describe what regular expressions are. 7 18 1 Regular Expressions

19 1 Regular Expressions
12 Convert a regular expression into its 20 1 Equivalence of Regular Expressions
equivalent NFA. and Finite Automata
8 21 1 Equivalence of Regular Expressions
and Finite Automata
22 1 Equivalence of Regular Expressions
and Finite Automata
13 Explain what nonregular languages are. 23 1 Nonregular Languages

9 24 1 Non-regular Languages
14 Use the pumping lemma to prove 25 1 The Pumping Lemma
nonregularity in languages.
26 1 The Pumping Lemma
10 27 1 The Pumping Lemma
28 2 MIDTERM EXAMINATION
15 Describe context-free grammars as more 11 29 1 Context-Free Grammars
powerful tool of describing languages.

30 1 Context-Free Grammars
16 Design a CFG for any given language. 31 1 Designing Context-Free Grammars

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 2 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

17 Define ambiguity as usedin context-free 12 32 1 Ambiguity
grammars.
18 Convert any CFG into its Chomsky 33 1 Chomsky Normal Form
Normal Form
34 1 Chomsky Normal Form
13 35 1 Chomsky Normal Form
19 Discuss pushdown automata as a tool in 36 1 Pushdown Automata
proving that a language is context-free.

37 1 Pushdown Automata
14 38 1 Pushdown Automata
39 2 PREFINAL EXAMINATION
20 Construct a PDA from any given CFG. 15 40 1 Equivalence pf Pushdown Automata
with Context-Free Grammars

41 1 Equivalence pf Pushdown Automata

with Context-Free Grammars

21 Describe non-context-free languages. 42 1 Non-Context Free Languages

23 Discuss turing machines as powerful 16 43 1 Turing Machines

modelling tools.
44 1 Turing Machines
24 Explain alternative definitions of turing 45 1 Variants of Turing Machines
machines.
17 46 1 Variants of Turing Machines
47 1 Variants of Turing Machines
25 Explain the use of turing machines for 48 1 Algorithms and Turing Machines
modelling algorithms.
18 49 1 Algorithms and Turing Machines
50 2 FINAL EXAMINATION

Reference books:
1 Sipser, Michael, Introduction to the theory of computation (2nd Ed.)
2 Hopcroft and Ullman, Introduction to automata theory, languages and computations
3 Cohen, Daniel, Introduction to computer theory
4 Denning, Dennis, and Qualitz, Machines, languages, and computation
5 Hopcroft, J.E., Motwani, R., Ullman, J.D., (2000), Introduction to automata theory ,
6 Kozen, Dexter C., (1999), Automata and computability , Springer
7 Ding-Zhu Du & Ker-I Ko, (2000), Theory of computational complexity , Wiley-
8 Interscience
Hromkovic, Juraj, (2003), Theoretical computer science : introduction to automata,
9 computability, complexity,
Martin, John, (2002), algorithmics,
Introduction randomization,
to languages communication,
and theory of computer and
(3rd ed.),
McGraw-Hill

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 3 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

1 Recall the different thoeries and 1 1 1 Course Orientation/Review of Set 1-26 1-15
concepts regarding sets. Theory
2 Describe functions and relations 2 1 Functions and Relations
3 Discuss the graphs, strings, and 3 1 Graphs 1-14 1-10
languages.
2 4 1 Graphs/Strings and Languages 1-9 1-6
4 Identify the appropriate method to use in 5 1 Types of Proofs 1-27 1-15
proving diffferent theorems and lemmas.

6 1 Types of Proofs
5 Discuss the formal definition of finite 3 7 1 Introduction to Finite Atuomata 1-25 1-14
automata.
8 1 Introduction to Finite Atuomata
6 Apply the different techniques in 9 1 Designing Deterministic Finite 1-29 1-16
desgining a finite automaton that can Automata
accept a given string.
7 Explain the regular operations that can 4 10 1 Designing Deterministic Finite
be performed on strings. Automata
8 Discuss the formal definition of 11 1 Nondeterministic Finite Automata 1-33 1-18
nondeterministic finite automata.
12 1 Nondeterministic Finite Automata
9 Convert any given NFA into its equivalent 5 13 1 Equivalence of NFAs and DFAs 1-21 1-13
DFA.
14 2 PRELIMINARY EXAMINATION
6 15 1 Equivalence of NFAs and DFAs 1-17 1-10
16 1 The Regular Operations on 1-31 1-19
Languages
10 Use nondeterminism to prove closure 17 1 The Regular Operations on
under the regular operations. Languages

11 Describe what regular expressions are. 7 18 1 Regular Expressions 1-10 1-8

19 1 Regular Expressions
12 Convert a regular expression into its 20 1 Equivalence of Regular Expressions 1-9 1-9
equivalent NFA. and Finite Automata
8 21 1 Equivalence of Regular Expressions
and Finite Automata
22 1 Equivalence of Regular Expressions
and Finite Automata
13 Explain what nonregular languages are. 23 1 Nonregular Languages

9 24 1 Non-regular Languages
14 Use the pumping lemma to prove 25 1 The Pumping Lemma
nonregularity in languages.
26 1 The Pumping Lemma
10 27 1 The Pumping Lemma
28 2 MIDTERM EXAMINATION
15 Describe context-free grammars as more 11 29 1 Context-Free Grammars
powerful tool of describing languages.

30 1 Context-Free Grammars
16 Design a CFG for any given language. 31 1 Designing Context-Free Grammars

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 2 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

17 Define ambiguity as usedin context-free 12 32 1 Ambiguity
grammars.
18 Convert any CFG into its Chomsky 33 1 Chomsky Normal Form
Normal Form
34 1 Chomsky Normal Form
13 35 1 Chomsky Normal Form
19 Discuss pushdown automata as a tool in 36 1 Pushdown Automata
proving that a language is context-free.

37 1 Pushdown Automata
14 38 1 Pushdown Automata
39 2 PREFINAL EXAMINATION
20 Construct a PDA from any given CFG. 15 40 1 Equivalence pf Pushdown Automata
with Context-Free Grammars

41 1 Equivalence pf Pushdown Automata

with Context-Free Grammars

21 Describe non-context-free languages. 42 1 Non-Context Free Languages

23 Discuss turing machines as powerful 16 43 1 Turing Machines

modelling tools.
44 1 Turing Machines
24 Explain alternative definitions of turing 45 1 Variants of Turing Machines
machines.
17 46 1 Variants of Turing Machines
47 1 Variants of Turing Machines
25 Explain the use of turing machines for 48 1 Algorithms and Turing Machines
modelling algorithms.
18 49 1 Algorithms and Turing Machines
50 2 FINAL EXAMINATION

Reference books:
1 Sipser, Michael, Introduction to the theory of computation (2nd Ed.)
2 Hopcroft and Ullman, Introduction to automata theory, languages and computations
3 Cohen, Daniel, Introduction to computer theory
4 Denning, Dennis, and Qualitz, Machines, languages, and computation
5 Hopcroft, J.E., Motwani, R., Ullman, J.D., (2000), Introduction to automata theory ,
6 Kozen, Dexter C., (1999), Automata and computability , Springer
7 Ding-Zhu Du & Ker-I Ko, (2000), Theory of computational complexity , Wiley-
8 Interscience
Hromkovic, Juraj, (2003), Theoretical computer science : introduction to automata,
9 computability,
Martin, complexity,
John, (2002), algorithmics,
Introduction randomization,
to languages communication,
and theory of computer and
(3rd ed.),
McGraw-Hill

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 3 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

1 Recall the different thoeries and 1 1 1 Course Orientation/Review of Set 1-26 1-15
concepts regarding sets. Theory
2 Describe functions and relations 2 1 Functions and Relations
3 Discuss the graphs, strings, and 3 1 Graphs 1-14 1-10
languages.
2 4 1 Graphs/Strings and Languages 1-9 1-6
4 Identify the appropriate method to use in 5 1 Types of Proofs 1-27 1-15
proving diffferent theorems and lemmas.

6 1 Types of Proofs
5 Discuss the formal definition of finite 3 7 1 Introduction to Finite Atuomata 1-25 1-14
automata.
8 1 Introduction to Finite Atuomata
6 Apply the different techniques in 9 1 Designing Deterministic Finite 1-29 1-16
desgining a finite automaton that can Automata
accept a given string.
7 Explain the regular operations that can 4 10 1 Designing Deterministic Finite
be performed on strings. Automata
8 Discuss the formal definition of 11 1 Nondeterministic Finite Automata 1-33 1-18
nondeterministic finite automata.
12 1 Nondeterministic Finite Automata
9 Convert any given NFA into its equivalent 5 13 1 Equivalence of NFAs and DFAs 1-21 1-13
DFA.
14 2 PRELIMINARY EXAMINATION
6 15 1 Equivalence of NFAs and DFAs 1-17 1-10
16 1 The Regular Operations on 1-31 1-19
Languages
10 Use nondeterminism to prove closure 17 1 The Regular Operations on
under the regular operations. Languages

11 Describe what regular expressions are. 7 18 1 Regular Expressions 1-10 1-8

19 1 Regular Expressions
12 Convert a regular expression into its 20 1 Equivalence of Regular Expressions 1-9 1-9
equivalent NFA. and Finite Automata
8 21 1 Equivalence of Regular Expressions 1-20 1-18
and Finite Automata
22 1 Equivalence of Regular Expressions
and Finite Automata
13 Explain what nonregular languages are. 23 1 Nonregular Languages 1-10 1-6

9 24 1 Non-regular Languages
14 Use the pumping lemma to prove 25 1 The Pumping Lemma
nonregularity in languages.
26 1 The Pumping Lemma
10 27 1 The Pumping Lemma
28 2 MIDTERM EXAMINATION
15 Describe context-free grammars as more 11 29 1 Context-Free Grammars
powerful tool of describing languages.

30 1 Context-Free Grammars
16 Design a CFG for any given language. 31 1 Designing Context-Free Grammars

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 2 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

17 Define ambiguity as usedin context-free 12 32 1 Ambiguity
grammars.
18 Convert any CFG into its Chomsky 33 1 Chomsky Normal Form
Normal Form
34 1 Chomsky Normal Form
13 35 1 Chomsky Normal Form
19 Discuss pushdown automata as a tool in 36 1 Pushdown Automata
proving that a language is context-free.

37 1 Pushdown Automata
14 38 1 Pushdown Automata
39 2 PREFINAL EXAMINATION
20 Construct a PDA from any given CFG. 15 40 1 Equivalence pf Pushdown Automata
with Context-Free Grammars

41 1 Equivalence pf Pushdown Automata

with Context-Free Grammars

21 Describe non-context-free languages. 42 1 Non-Context Free Languages

23 Discuss turing machines as powerful 16 43 1 Turing Machines

modelling tools.
44 1 Turing Machines
24 Explain alternative definitions of turing 45 1 Variants of Turing Machines
machines.
17 46 1 Variants of Turing Machines
47 1 Variants of Turing Machines
25 Explain the use of turing machines for 48 1 Algorithms and Turing Machines
modelling algorithms.
18 49 1 Algorithms and Turing Machines
50 2 FINAL EXAMINATION

Reference books:
1 Sipser, Michael, Introduction to the theory of computation (2nd Ed.)
2 Hopcroft and Ullman, Introduction to automata theory, languages and computations
3 Cohen, Daniel, Introduction to computer theory
4 Denning, Dennis, and Qualitz, Machines, languages, and computation
5 Hopcroft, J.E., Motwani, R., Ullman, J.D., (2000), Introduction to automata theory ,
6 Kozen, Dexter C., (1999), Automata and computability , Springer
7 Ding-Zhu Du & Ker-I Ko, (2000), Theory of computational complexity , Wiley-
8 Interscience
Hromkovic, Juraj, (2003), Theoretical computer science : introduction to automata,
9 computability, complexity,
Martin, John, (2002), algorithmics,
Introduction randomization,
to languages communication,
and theory of computer and
(3rd ed.),
McGraw-Hill

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 3 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

1 Recall the different thoeries and 1 1 1 Course Orientation/Review of Set 1-26 1-15
concepts regarding sets. Theory
2 Describe functions and relations 2 1 Functions and Relations
3 Discuss the graphs, strings, and 3 1 Graphs 1-14 1-10
languages.
2 4 1 Graphs/Strings and Languages 1-9 1-6
4 Identify the appropriate method to use in 5 1 Types of Proofs 1-27 1-15
proving diffferent theorems and lemmas.

6 1 Types of Proofs
5 Discuss the formal definition of finite 3 7 1 Introduction to Finite Atuomata 1-25 1-14
automata.
8 1 Introduction to Finite Atuomata
6 Apply the different techniques in 9 1 Designing Deterministic Finite 1-29 1-16
desgining a finite automaton that can Automata
accept a given string.
7 Explain the regular operations that can 4 10 1 Designing Deterministic Finite
be performed on strings. Automata
8 Discuss the formal definition of 11 1 Nondeterministic Finite Automata 1-33 1-18
nondeterministic finite automata.
12 1 Nondeterministic Finite Automata
9 Convert any given NFA into its equivalent 5 13 1 Equivalence of NFAs and DFAs 1-21 1-13
DFA.
14 2 PRELIMINARY EXAMINATION
6 15 1 Equivalence of NFAs and DFAs 1-17 1-10
16 1 The Regular Operations on 1-31 1-19
Languages
10 Use nondeterminism to prove closure 17 1 The Regular Operations on
under the regular operations. Languages

11 Describe what regular expressions are. 7 18 1 Regular Expressions 1-10 1-8

19 1 Regular Expressions
12 Convert a regular expression into its 20 1 Equivalence of Regular Expressions 1-9 1-9
equivalent NFA. and Finite Automata
8 21 1 Equivalence of Regular Expressions 1-20 1-18
and Finite Automata
22 1 Equivalence of Regular Expressions
and Finite Automata
13 Explain what nonregular languages are. 23 1 Nonregular Languages 1-10 1-6

14 Use the pumping lemma to prove 9 24 1 The Pumping Lemma 1-21 1-12
nonregularity in languages.
25 1 The Pumping Lemma
15 Describe context-free grammars as more 26 1 Context-Free Language 1-22 1-15
powerful tool of describing languages.

10 27 1 Context-Free Languages
28 2 MIDTERM EXAMINATION
16 Design a CFG for any given language. 11 29 1 Designing Context-Free Grammars

30 1 Designing Context-Free Grammars

31 1 Designing Context-Free Grammars

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 2 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

17 Define ambiguity as usedin context-free 12 32 1 Ambiguity
grammars.
18 Convert any CFG into its Chomsky 33 1 Chomsky Normal Form
Normal Form
34 1 Chomsky Normal Form
13 35 1 Chomsky Normal Form
19 Discuss pushdown automata as a tool in 36 1 Pushdown Automata
proving that a language is context-free.

37 1 Pushdown Automata
14 38 1 Pushdown Automata
39 2 PREFINAL EXAMINATION
20 Construct a PDA from any given CFG. 15 40 1 Equivalence pf Pushdown Automata
with Context-Free Grammars

41 1 Equivalence pf Pushdown Automata

with Context-Free Grammars

21 Describe non-context-free languages. 42 1 Non-Context Free Languages

23 Discuss turing machines as powerful 16 43 1 Turing Machines

modelling tools.
44 1 Turing Machines
24 Explain alternative definitions of turing 45 1 Variants of Turing Machines
machines.
17 46 1 Variants of Turing Machines
47 1 Variants of Turing Machines
25 Explain the use of turing machines for 48 1 Algorithms and Turing Machines
modelling algorithms.
18 49 1 Algorithms and Turing Machines
50 2 FINAL EXAMINATION

Reference books:
1 Sipser, Michael, Introduction to the theory of computation (2nd Ed.)
2 Hopcroft and Ullman, Introduction to automata theory, languages and computations
3 Cohen, Daniel, Introduction to computer theory
4 Denning, Dennis, and Qualitz, Machines, languages, and computation
5 Hopcroft, J.E., Motwani, R., Ullman, J.D., (2000), Introduction to automata theory ,
6 Kozen, Dexter C., (1999), Automata and computability , Springer
7 Ding-Zhu Du & Ker-I Ko, (2000), Theory of computational complexity , Wiley-
8 Interscience
Hromkovic, Juraj, (2003), Theoretical computer science : introduction to automata,
9 computability,
Martin, complexity,
John, (2002), algorithmics,
Introduction randomization,
to languages communication,
and theory of computer and
(3rd ed.),
McGraw-Hill

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 3 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

1 Recall the different thoeries and 1 1 1 Course Orientation/Review of Set 1-26 1-15
concepts regarding sets. Theory
2 Describe functions and relations 2 1 Functions and Relations
3 Discuss the graphs, strings, and 3 1 Graphs 1-14 1-10
languages.
2 4 1 Graphs/Strings and Languages 1-9 1-6
4 Identify the appropriate method to use in 5 1 Types of Proofs 1-27 1-15
proving diffferent theorems and lemmas.

6 1 Types of Proofs
5 Discuss the formal definition of finite 3 7 1 Introduction to Finite Atuomata 1-25 1-14
automata.
8 1 Introduction to Finite Atuomata
6 Apply the different techniques in 9 1 Designing Deterministic Finite 1-29 1-16
desgining a finite automaton that can Automata
accept a given string.
7 Explain the regular operations that can 4 10 1 Designing Deterministic Finite
be performed on strings. Automata
8 Discuss the formal definition of 11 1 Nondeterministic Finite Automata 1-33 1-18
nondeterministic finite automata.
12 1 Nondeterministic Finite Automata
9 Convert any given NFA into its equivalent 5 13 1 Equivalence of NFAs and DFAs 1-21 1-13
DFA.
14 2 PRELIMINARY EXAMINATION
6 15 1 Equivalence of NFAs and DFAs 1-17 1-10
16 1 The Regular Operations on 1-31 1-19
Languages
10 Use nondeterminism to prove closure 17 1 The Regular Operations on
under the regular operations. Languages

11 Describe what regular expressions are. 7 18 1 Regular Expressions 1-10 1-8

19 1 Regular Expressions
12 Convert a regular expression into its 20 1 Equivalence of Regular Expressions 1-9 1-9
equivalent NFA. and Finite Automata
8 21 1 Equivalence of Regular Expressions 1-20 1-18
and Finite Automata
22 1 Equivalence of Regular Expressions
and Finite Automata
13 Explain what nonregular languages are. 23 1 Nonregular Languages 1-10 1-6

14 Use the pumping lemma to prove 9 24 1 The Pumping Lemma 1-21 1-12
nonregularity in languages.
25 1 The Pumping Lemma
15 Describe context-free grammars as more 26 1 Context-Free Language 1-22 1-15
powerful tool of describing languages.

10 27 1 Context-Free Languages
28 2 MIDTERM EXAMINATION
16 Define ambiguity as used in context-free 11 29 1 Ambiguity 1-9 1-7
grammars.
17 Convert any CFG into its Chomsky 30 1 Chomsky Normal Form 1-16 1-11
Normal Form
31 1 Chomsky Normal Form
APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15
* Property of STI PAGE: 2 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

18 Discuss pushdown automata as a tool in 12 32 1 Pushdown Automata
proving that a language is context-free. 33 1 Pushdown Automata
34 1 Pushdown Automata
19 Construct a PDA from any given CFG 13 35 1 Equivalence of Pushdown Automata
and vice-versa. with Context-Free Grammars

36 1 Equivalence pf Pushdown Automata

with Context-Free Grammars

37 1 Equivalence pf Pushdown Automata

with Context-Free Grammars

20 Apply the pumping lemma for context- 14 38 1 Non-Context Free Languages

free languages
39 2 PREFINAL EXAMINATION
21 Discuss turing machines as powerful 15 40 1 Turing Machines
modeling tools.
41 1 Turing Machines
Describe non-context-free languages. 42 1 Turing Machines

22 Explain alternative definitions of turing 16 43 1 Variants of Turing Machines

machines.
44 1 Variants of Turing Machines
45 1 Variants of Turing Machines
17 46 1 Variants of Turing Machines
47 1 Variants of Turing Machines
23 Explain the use of turing machines for 48 1 Algorithms and Turing Machines
modelling algorithms.
18 49 1 Algorithms and Turing Machines
50 2 FINAL EXAMINATION

Reference books:
1 Sipser, Michael, Introduction to the theory of computation (2nd Ed.)
2 Hopcroft and Ullman, Introduction to automata theory, languages and computations
3 Cohen, Daniel, Introduction to computer theory
4 Denning, Dennis, and Qualitz, Machines, languages, and computation
5 Hopcroft, J.E., Motwani, R., Ullman, J.D., (2000), Introduction to automata theory ,
6 Kozen, Dexter C., (1999), Automata and computability , Springer
7 Ding-Zhu Du & Ker-I Ko, (2000), Theory of computational complexity , Wiley-
8 Interscience
Hromkovic, Juraj, (2003), Theoretical computer science : introduction to automata,
9 computability, complexity,
Martin, John, (2002), algorithmics,
Introduction randomization,
to languages communication,
and theory of computer and
(3rd ed.),
McGraw-Hill

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 3 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

1 Recall the different thoeries and 1 1 1 Course Orientation/Review of Set 1-26 1-15
concepts regarding sets. Theory
2 Describe functions and relations 2 1 Functions and Relations
3 Discuss the graphs, strings, and 3 1 Graphs 1-14 1-10
languages.
2 4 1 Graphs/Strings and Languages 1-9 1-6
4 Identify the appropriate method to use in 5 1 Types of Proofs 1-27 1-15
proving diffferent theorems and lemmas.

6 1 Types of Proofs
5 Discuss the formal definition of finite 3 7 1 Introduction to Finite Atuomata 1-25 1-14
automata.
8 1 Introduction to Finite Atuomata
6 Apply the different techniques in 9 1 Designing Deterministic Finite 1-29 1-16
desgining a finite automaton that can Automata
accept a given string.
7 Explain the regular operations that can 4 10 1 Designing Deterministic Finite
be performed on strings. Automata
8 Discuss the formal definition of 11 1 Nondeterministic Finite Automata 1-33 1-18
nondeterministic finite automata.
12 1 Nondeterministic Finite Automata
9 Convert any given NFA into its equivalent 5 13 1 Equivalence of NFAs and DFAs 1-21 1-13
DFA.
14 2 PRELIMINARY EXAMINATION
6 15 1 Equivalence of NFAs and DFAs 1-17 1-10
16 1 The Regular Operations on 1-31 1-19
Languages
10 Use nondeterminism to prove closure 17 1 The Regular Operations on
under the regular operations. Languages

11 Describe what regular expressions are. 7 18 1 Regular Expressions 1-10 1-8

19 1 Regular Expressions
12 Convert a regular expression into its 20 1 Equivalence of Regular Expressions 1-9 1-9
equivalent NFA. and Finite Automata
8 21 1 Equivalence of Regular Expressions 1-20 1-18
and Finite Automata
22 1 Equivalence of Regular Expressions
and Finite Automata
13 Explain what nonregular languages are. 23 1 Nonregular Languages 1-10 1-6

14 Use the pumping lemma to prove 9 24 1 The Pumping Lemma 1-21 1-12
nonregularity in languages.
25 1 The Pumping Lemma
15 Describe context-free grammars as more 26 1 Context-Free Language 1-22 1-15
powerful tool of describing languages.

10 27 1 Context-Free Languages
28 2 MIDTERM EXAMINATION
16 Define ambiguity as used in context-free 11 29 1 Ambiguity 1-9 1-7
grammars.
17 Convert any CFG into its Chomsky 30 1 Chomsky Normal Form 1-16 1-11
Normal Form
31 1 Chomsky Normal Form
APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15
* Property of STI PAGE: 2 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

18 Discuss pushdown automata as a tool in 12 32 1 Pushdown Automata 1-20 1-16
proving that a language is context-free. 33 1 Pushdown Automata
34 1 Pushdown Automata
19 Construct a PDA from any given CFG 13 35 1 Equivalence of Pushdown Automata
and vice-versa. with Context-Free Grammars

36 1 Equivalence pf Pushdown Automata

with Context-Free Grammars

37 1 Equivalence pf Pushdown Automata

with Context-Free Grammars

20 Apply the pumping lemma for context- 14 38 1 Non-Context Free Languages

free languages
39 2 PREFINAL EXAMINATION
21 Discuss turing machines as powerful 15 40 1 Turing Machines
modeling tools.
41 1 Turing Machines
Describe non-context-free languages. 42 1 Turing Machines

22 Explain alternative definitions of turing 16 43 1 Variants of Turing Machines

machines.
44 1 Variants of Turing Machines
45 1 Variants of Turing Machines
17 46 1 Variants of Turing Machines
47 1 Variants of Turing Machines
23 Explain the use of turing machines for 48 1 Algorithms and Turing Machines
modelling algorithms.
18 49 1 Algorithms and Turing Machines
50 2 FINAL EXAMINATION

Reference books:
1 Sipser, Michael, Introduction to the theory of computation (2nd Ed.)
2 Hopcroft and Ullman, Introduction to automata theory, languages and computations
3 Cohen, Daniel, Introduction to computer theory
4 Denning, Dennis, and Qualitz, Machines, languages, and computation
5 Hopcroft, J.E., Motwani, R., Ullman, J.D., (2000), Introduction to automata theory ,
6 Kozen, Dexter C., (1999), Automata and computability , Springer
7 Ding-Zhu Du & Ker-I Ko, (2000), Theory of computational complexity , Wiley-
8 Interscience
Hromkovic, Juraj, (2003), Theoretical computer science : introduction to automata,
9 computability, complexity,
Martin, John, (2002), algorithmics,
Introduction randomization,
to languages communication,
and theory of computer and
(3rd ed.),
McGraw-Hill

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 3 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

1 Recall the different thoeries and 1 1 1 Course Orientation/Review of Set 1-26 1-15
concepts regarding sets. Theory
2 Describe functions and relations 2 1 Functions and Relations
3 Discuss the graphs, strings, and 3 1 Graphs 1-14 1-10
languages.
2 4 1 Graphs/Strings and Languages 1-9 1-6
4 Identify the appropriate method to use in 5 1 Types of Proofs 1-27 1-15
proving diffferent theorems and lemmas.

6 1 Types of Proofs
5 Discuss the formal definition of finite 3 7 1 Introduction to Finite Atuomata 1-25 1-14
automata.
8 1 Introduction to Finite Atuomata
6 Apply the different techniques in 9 1 Designing Deterministic Finite 1-29 1-16
desgining a finite automaton that can Automata
accept a given string.
7 Explain the regular operations that can 4 10 1 Designing Deterministic Finite
be performed on strings. Automata
8 Discuss the formal definition of 11 1 Nondeterministic Finite Automata 1-33 1-18
nondeterministic finite automata.
12 1 Nondeterministic Finite Automata
9 Convert any given NFA into its equivalent 5 13 1 Equivalence of NFAs and DFAs 1-21 1-13
DFA.
14 2 PRELIMINARY EXAMINATION
6 15 1 Equivalence of NFAs and DFAs 1-17 1-10
16 1 The Regular Operations on 1-31 1-19
Languages
10 Use nondeterminism to prove closure 17 1 The Regular Operations on
under the regular operations. Languages

11 Describe what regular expressions are. 7 18 1 Regular Expressions 1-10 1-8

19 1 Regular Expressions
12 Convert a regular expression into its 20 1 Equivalence of Regular Expressions 1-9 1-9
equivalent NFA. and Finite Automata
8 21 1 Equivalence of Regular Expressions 1-20 1-18
and Finite Automata
22 1 Equivalence of Regular Expressions
and Finite Automata
13 Explain what nonregular languages are. 23 1 Nonregular Languages 1-10 1-6

14 Use the pumping lemma to prove 9 24 1 The Pumping Lemma 1-21 1-12
nonregularity in languages.
25 1 The Pumping Lemma
15 Describe context-free grammars as more 26 1 Context-Free Language 1-22 1-15
powerful tool of describing languages.

10 27 1 Context-Free Languages
28 2 MIDTERM EXAMINATION
16 Define ambiguity as used in context-free 11 29 1 Ambiguity 1-9 1-7
grammars.
17 Convert any CFG into its Chomsky 30 1 Chomsky Normal Form 1-16 1-11
Normal Form
31 1 Chomsky Normal Form
APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15
* Property of STI PAGE: 2 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

18 Discuss pushdown automata as a tool in 12 32 1 Pushdown Automata 1-20 1-16
proving that a language is context-free. 33 1 Pushdown Automata
34 1 Pushdown Automata
19 Construct a PDA from any given CFG 13 35 1 Equivalence of Pushdown Automata 1-31 1-19
and vice-versa. with Context-Free Grammars

36 1 Equivalence pf Pushdown Automata

with Context-Free Grammars

37 1 Equivalence pf Pushdown Automata

with Context-Free Grammars

20 Apply the pumping lemma for context- 14 38 1 Non-Context Free Languages

free languages
39 2 PREFINAL EXAMINATION
21 Discuss turing machines as powerful 15 40 1 Turing Machines
modeling tools.
41 1 Turing Machines
Describe non-context-free languages. 42 1 Turing Machines

22 Explain alternative definitions of turing 16 43 1 Variants of Turing Machines

machines.
44 1 Variants of Turing Machines
45 1 Variants of Turing Machines
17 46 1 Variants of Turing Machines
47 1 Variants of Turing Machines
23 Explain the use of turing machines for 48 1 Algorithms and Turing Machines
modelling algorithms.
18 49 1 Algorithms and Turing Machines
50 2 FINAL EXAMINATION

Reference books:
1 Sipser, Michael, Introduction to the theory of computation (2nd Ed.)
2 Hopcroft and Ullman, Introduction to automata theory, languages and computations
3 Cohen, Daniel, Introduction to computer theory
4 Denning, Dennis, and Qualitz, Machines, languages, and computation
5 Hopcroft, J.E., Motwani, R., Ullman, J.D., (2000), Introduction to automata theory ,
6 Kozen, Dexter C., (1999), Automata and computability , Springer
7 Ding-Zhu Du & Ker-I Ko, (2000), Theory of computational complexity , Wiley-
8 Interscience
Hromkovic, Juraj, (2003), Theoretical computer science : introduction to automata,
9 computability, complexity,
Martin, John, (2002), algorithmics,
Introduction randomization,
to languages communication,
and theory of computer and
(3rd ed.),
McGraw-Hill

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 3 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

1 Recall the different thoeries and 1 1 1 Course Orientation/Review of Set 1-26 1-15
concepts regarding sets. Theory
2 Describe functions and relations 2 1 Functions and Relations
3 Discuss the graphs, strings, and 3 1 Graphs 1-14 1-10
languages.
2 4 1 Graphs/Strings and Languages 1-9 1-6
4 Identify the appropriate method to use in 5 1 Types of Proofs 1-27 1-15
proving diffferent theorems and lemmas.

6 1 Types of Proofs
5 Discuss the formal definition of finite 3 7 1 Introduction to Finite Atuomata 1-25 1-14
automata.
8 1 Introduction to Finite Atuomata
6 Apply the different techniques in 9 1 Designing Deterministic Finite 1-29 1-16
desgining a finite automaton that can Automata
accept a given string.
7 Explain the regular operations that can 4 10 1 Designing Deterministic Finite
be performed on strings. Automata
8 Discuss the formal definition of 11 1 Nondeterministic Finite Automata 1-33 1-18
nondeterministic finite automata.
12 1 Nondeterministic Finite Automata
9 Convert any given NFA into its equivalent 5 13 1 Equivalence of NFAs and DFAs 1-21 1-13
DFA.
14 2 PRELIMINARY EXAMINATION
6 15 1 Equivalence of NFAs and DFAs 1-17 1-10
16 1 The Regular Operations on 1-31 1-19
Languages
10 Use nondeterminism to prove closure 17 1 The Regular Operations on
under the regular operations. Languages

11 Describe what regular expressions are. 7 18 1 Regular Expressions 1-10 1-8

19 1 Regular Expressions
12 Convert a regular expression into its 20 1 Equivalence of Regular Expressions 1-9 1-9
equivalent NFA. and Finite Automata
8 21 1 Equivalence of Regular Expressions 1-20 1-18
and Finite Automata
22 1 Equivalence of Regular Expressions
and Finite Automata
13 Explain what nonregular languages are. 23 1 Nonregular Languages 1-10 1-6

14 Use the pumping lemma to prove 9 24 1 The Pumping Lemma 1-21 1-12
nonregularity in languages.
25 1 The Pumping Lemma
15 Describe context-free grammars as more 26 1 Context-Free Language 1-22 1-15
powerful tool of describing languages.

10 27 1 Context-Free Languages
28 2 MIDTERM EXAMINATION
16 Define ambiguity as used in context-free 11 29 1 Ambiguity 1-9 1-7
grammars.
17 Convert any CFG into its Chomsky 30 1 Chomsky Normal Form 1-16 1-11
Normal Form
31 1 Chomsky Normal Form
APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15
* Property of STI PAGE: 2 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

18 Discuss pushdown automata as a tool in 12 32 1 Pushdown Automata 1-20 1-16
proving that a language is context-free. 33 1 Pushdown Automata
34 1 Pushdown Automata
19 Construct a PDA from any given CFG 13 35 1 Equivalence of Pushdown Automata 1-31 1-19
and vice-versa. with Context-Free Grammars (CFG to
PDA)
36 1 Equivalence of Pushdown Automata
with Context-Free Grammars (CFG to
PDA)
37 1 Equivalence of Pushdown Automata
with Context-Free Grammars (CFG to
PDA)
14 38 1 Equivalence of Pushdown Automata 1-23 1-13
with Context-Free Grammars (PDA to
CFG)
39 2 PREFINAL EXAMINATION
20 Apply the pumping lemma for context- 15 40 1 Non Context-Free Languages
free languages 41 1 Non Context-Free Languages
42 1 Non Context-Free Languages
21 Discuss turing machines as powerful 16 43 1 Turing Machines
modelling tools. 44 1 Turing Machines
45 1 Turing Machines
22 Explain alternative definitions of turing 17 46 1 Variants of Turing Machines
machines. 47 1 Variants of Turing Machines
48 1 Variants of Turing Machines
18 49 1 Variants of Turing Machines
50 2 FINAL EXAMINATION

Reference books:
1 Sipser, Michael, Introduction to the theory of computation (2nd Ed.)
2 Hopcroft and Ullman, Introduction to automata theory, languages and computations
3 Cohen, Daniel, Introduction to computer theory
4 Denning, Dennis, and Qualitz, Machines, languages, and computation
5 Hopcroft, J.E., Motwani, R., Ullman, J.D., (2000), Introduction to automata theory ,
6 Kozen, Dexter C., (1999), Automata and computability , Springer
7 Ding-Zhu Du & Ker-I Ko, (2000), Theory of computational complexity , Wiley-
8 InterscienceJuraj, (2003), Theoretical computer science : introduction to automata,
Hromkovic,
9 computability, complexity,
Martin, John, (2002), algorithmics,
Introduction randomization,
to languages communication,
and theory of computer and
(3rd ed.),
McGraw-Hill

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 3 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

1 Recall the different thoeries and 1 1 1 Course Orientation/Review of Set 1-26 1-15
concepts regarding sets. Theory
2 Describe functions and relations 2 1 Functions and Relations
3 Discuss the graphs, strings, and 3 1 Graphs 1-14 1-10
languages.
2 4 1 Graphs/Strings and Languages 1-9 1-6
4 Identify the appropriate method to use in 5 1 Types of Proofs 1-27 1-15
proving diffferent theorems and lemmas.

6 1 Types of Proofs
5 Discuss the formal definition of finite 3 7 1 Introduction to Finite Atuomata 1-25 1-14
automata.
8 1 Introduction to Finite Atuomata
6 Apply the different techniques in 9 1 Designing Deterministic Finite 1-29 1-16
desgining a finite automaton that can Automata
accept a given string.
7 Explain the regular operations that can 4 10 1 Designing Deterministic Finite
be performed on strings. Automata
8 Discuss the formal definition of 11 1 Nondeterministic Finite Automata 1-33 1-18
nondeterministic finite automata.
12 1 Nondeterministic Finite Automata
9 Convert any given NFA into its equivalent 5 13 1 Equivalence of NFAs and DFAs 1-21 1-13
DFA.
14 2 PRELIMINARY EXAMINATION
6 15 1 Equivalence of NFAs and DFAs 1-17 1-10
16 1 The Regular Operations on 1-31 1-19
Languages
10 Use nondeterminism to prove closure 17 1 The Regular Operations on
under the regular operations. Languages

11 Describe what regular expressions are. 7 18 1 Regular Expressions 1-10 1-8

19 1 Regular Expressions
12 Convert a regular expression into its 20 1 Equivalence of Regular Expressions 1-9 1-9
equivalent NFA. and Finite Automata
8 21 1 Equivalence of Regular Expressions 1-20 1-18
and Finite Automata
22 1 Equivalence of Regular Expressions
and Finite Automata
13 Explain what nonregular languages are. 23 1 Nonregular Languages 1-10 1-6

14 Use the pumping lemma to prove 9 24 1 The Pumping Lemma 1-21 1-12
nonregularity in languages.
25 1 The Pumping Lemma
15 Describe context-free grammars as more 26 1 Context-Free Language 1-22 1-15
powerful tool of describing languages.

10 27 1 Context-Free Languages
28 2 MIDTERM EXAMINATION
16 Define ambiguity as used in context-free 11 29 1 Ambiguity 1-9 1-7
grammars.
17 Convert any CFG into its Chomsky 30 1 Chomsky Normal Form 1-16 1-11
Normal Form
31 1 Chomsky Normal Form
APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15
* Property of STI PAGE: 2 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

18 Discuss pushdown automata as a tool in 12 32 1 Pushdown Automata 1-20 1-16
proving that a language is context-free. 33 1 Pushdown Automata
34 1 Pushdown Automata
19 Construct a PDA from any given CFG 13 35 1 Equivalence of Pushdown Automata 1-31 1-19
and vice-versa. with Context-Free Grammars (CFG to
PDA)
36 1 Equivalence of Pushdown Automata
with Context-Free Grammars (CFG to
PDA)
37 1 Equivalence of Pushdown Automata
with Context-Free Grammars (CFG to
PDA)
14 38 1 Equivalence of Pushdown Automata 1-23 1-13
with Context-Free Grammars (PDA to
CFG)
39 2 PREFINAL EXAMINATION
20 Apply the pumping lemma for context- 15 40 1 Non Context-Free Languages 1-34 1-18
free languages 41 1 Non Context-Free Languages
42 1 Non Context-Free Languages
21 Discuss turing machines as powerful 16 43 1 Turing Machines
modelling tools. 44 1 Turing Machines
45 1 Turing Machines
22 Explain alternative definitions of turing 17 46 1 Variants of Turing Machines
machines. 47 1 Variants of Turing Machines
48 1 Variants of Turing Machines
18 49 1 Variants of Turing Machines
50 2 FINAL EXAMINATION

Reference books:
1 Sipser, Michael, Introduction to the theory of computation (2nd Ed.)
2 Hopcroft and Ullman, Introduction to automata theory, languages and computations
3 Cohen, Daniel, Introduction to computer theory
4 Denning, Dennis, and Qualitz, Machines, languages, and computation
5 Hopcroft, J.E., Motwani, R., Ullman, J.D., (2000), Introduction to automata theory ,
6 Kozen, Dexter C., (1999), Automata and computability , Springer
7 Ding-Zhu Du & Ker-I Ko, (2000), Theory of computational complexity , Wiley-
8 InterscienceJuraj, (2003), Theoretical computer science : introduction to automata,
Hromkovic,
9 computability,
Martin, complexity,
John, (2002), algorithmics,
Introduction randomization,
to languages communication,
and theory of computer and
(3rd ed.),
McGraw-Hill

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 3 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

1 Recall the different thoeries and 1 1 1 Course Orientation/Review of Set 1-26 1-15
concepts regarding sets. Theory
2 Describe functions and relations 2 1 Functions and Relations
3 Discuss the graphs, strings, and 3 1 Graphs 1-14 1-10
languages.
2 4 1 Graphs/Strings and Languages 1-9 1-6
4 Identify the appropriate method to use in 5 1 Types of Proofs 1-27 1-15
proving diffferent theorems and lemmas.

6 1 Types of Proofs
5 Discuss the formal definition of finite 3 7 1 Introduction to Finite Atuomata 1-25 1-14
automata.
8 1 Introduction to Finite Atuomata
6 Apply the different techniques in 9 1 Designing Deterministic Finite 1-29 1-16
desgining a finite automaton that can Automata
accept a given string.
7 Explain the regular operations that can 4 10 1 Designing Deterministic Finite
be performed on strings. Automata
8 Discuss the formal definition of 11 1 Nondeterministic Finite Automata 1-33 1-18
nondeterministic finite automata.
12 1 Nondeterministic Finite Automata
9 Convert any given NFA into its equivalent 5 13 1 Equivalence of NFAs and DFAs 1-21 1-13
DFA.
14 2 PRELIMINARY EXAMINATION
6 15 1 Equivalence of NFAs and DFAs 1-17 1-10
16 1 The Regular Operations on 1-31 1-19
Languages
10 Use nondeterminism to prove closure 17 1 The Regular Operations on
under the regular operations. Languages

11 Describe what regular expressions are. 7 18 1 Regular Expressions 1-10 1-8

19 1 Regular Expressions
12 Convert a regular expression into its 20 1 Equivalence of Regular Expressions 1-9 1-9
equivalent NFA. and Finite Automata
8 21 1 Equivalence of Regular Expressions 1-20 1-18
and Finite Automata
22 1 Equivalence of Regular Expressions
and Finite Automata
13 Explain what nonregular languages are. 23 1 Nonregular Languages 1-10 1-6

14 Use the pumping lemma to prove 9 24 1 The Pumping Lemma 1-21 1-12
nonregularity in languages.
25 1 The Pumping Lemma
15 Describe context-free grammars as more 26 1 Context-Free Language 1-22 1-15
powerful tool of describing languages.

10 27 1 Context-Free Languages
28 2 MIDTERM EXAMINATION
16 Define ambiguity as used in context-free 11 29 1 Ambiguity 1-9 1-7
grammars.
17 Convert any CFG into its Chomsky 30 1 Chomsky Normal Form 1-16 1-11
Normal Form
31 1 Chomsky Normal Form
APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15
* Property of STI PAGE: 2 of 3
 BSCS1201-THECOMP01
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

18 Discuss pushdown automata as a tool in 12 32 1 Pushdown Automata 1-20 1-16
proving that a language is context-free. 33 1 Pushdown Automata
34 1 Pushdown Automata
19 Construct a PDA from any given CFG 13 35 1 Equivalence of Pushdown Automata 1-31 1-19
and vice-versa. with Context-Free Grammars (CFG to
PDA)
36 1 Equivalence of Pushdown Automata
with Context-Free Grammars (CFG to
PDA)
37 1 Equivalence of Pushdown Automata
with Context-Free Grammars (CFG to
PDA)
14 38 1 Equivalence of Pushdown Automata 1-23 1-13
with Context-Free Grammars (PDA to
CFG)
39 2 PREFINAL EXAMINATION
20 Apply the pumping lemma for context- 15 40 1 Non Context-Free Languages 1-34 1-18
free languages 41 1 Non Context-Free Languages
42 1 Non Context-Free Languages
21 Discuss turing machines as powerful 16 43 1 Turing Machines 1-26 1-25
modelling tools. 44 1 Turing Machines
45 1 Turing Machines
22 Explain alternative definitions of turing 17 46 1 Variants of Turing Machines
machines. 47 1 Variants of Turing Machines
48 1 Variants of Turing Machines
18 49 1 Variants of Turing Machines
50 2 FINAL EXAMINATION

Reference books:
1 Sipser, Michael, Introduction to the theory of computation (2nd Ed.)
2 Hopcroft and Ullman, Introduction to automata theory, languages and computations
3 Cohen, Daniel, Introduction to computer theory
4 Denning, Dennis, and Qualitz, Machines, languages, and computation
5 Hopcroft, J.E., Motwani, R., Ullman, J.D., (2000), Introduction to automata theory ,
6 Kozen, Dexter C., (1999), Automata and computability , Springer
7 Ding-Zhu Du & Ker-I Ko, (2000), Theory of computational complexity , Wiley-
8 InterscienceJuraj, (2003), Theoretical computer science : introduction to automata,
Hromkovic,
9 computability,
Martin, complexity,
John, (2002), algorithmics,
Introduction randomization,
to languages communication,
and theory of computer and
(3rd ed.),
McGraw-Hill

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 3 of 3
 BSCS1201-THECOMP
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

1 Recall the different thoeries and 1 1 1 Course Orientation/Review of Set 1-26 1-15
concepts regarding sets. Theory
2 Describe functions and relations 2 1 Functions and Relations
3 Discuss the graphs, strings, and 3 1 Graphs 1-14 1-10
languages.
2 4 1 Graphs/Strings and Languages 1-9 1-6
4 Identify the appropriate method to use in 5 1 Types of Proofs 1-27 1-15
proving diffferent theorems and lemmas.

6 1 Types of Proofs
5 Discuss the formal definition of finite 3 7 1 Introduction to Finite Atuomata 1-25 1-14
automata.
8 1 Introduction to Finite Atuomata
6 Apply the different techniques in 9 1 Designing Deterministic Finite 1-29 1-16
desgining a finite automaton that can Automata
accept a given string.
7 Explain the regular operations that can 4 10 1 Designing Deterministic Finite
be performed on strings. Automata
8 Discuss the formal definition of 11 1 Nondeterministic Finite Automata 1-33 1-18
nondeterministic finite automata.
12 1 Nondeterministic Finite Automata
9 Convert any given NFA into its equivalent 5 13 1 Equivalence of NFAs and DFAs 1-21 1-13
DFA.
14 2 PRELIMINARY EXAMINATION
6 15 1 Equivalence of NFAs and DFAs 1-17 1-10
16 1 The Regular Operations on 1-31 1-19
Languages
10 Use nondeterminism to prove closure 17 1 The Regular Operations on
under the regular operations. Languages

11 Describe what regular expressions are. 7 18 1 Regular Expressions 1-10 1-8

19 1 Regular Expressions
12 Convert a regular expression into its 20 1 Equivalence of Regular Expressions 1-9 1-9
equivalent NFA. and Finite Automata
8 21 1 Equivalence of Regular Expressions 1-20 1-18
and Finite Automata
22 1 Equivalence of Regular Expressions
and Finite Automata
13 Explain what nonregular languages are. 23 1 Nonregular Languages 1-10 1-6

14 Use the pumping lemma to prove 9 24 1 The Pumping Lemma 1-21 1-12
nonregularity in languages.
25 1 The Pumping Lemma
15 Describe context-free grammars as more 26 1 Context-Free Language 1-22 1-15
powerful tool of describing languages.

10 27 1 Context-Free Languages
28 2 MIDTERM EXAMINATION
16 Define ambiguity as used in context-free 11 29 1 Ambiguity 1-9 1-7
grammars.
17 Convert any CFG into its Chomsky 30 1 Chomsky Normal Form 1-16 1-11
Normal Form
31 1 Chomsky Normal Form
APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15
* Property of STI PAGE: 2 of 3
 BSCS1201-THECOMP
Theory of Computation (With Automata Theory)

Specific Objectives Lec Instructor's Student

Wk Topics Slides
Behavioral Ses Hrs Guide Handouts

At the end of the lesson, the students are expected to:

18 Discuss pushdown automata as a tool in 12 32 1 Pushdown Automata 1-20 1-16
proving that a language is context-free. 33 1 Pushdown Automata
34 1 Pushdown Automata
19 Construct a PDA from any given CFG 13 35 1 Equivalence of Pushdown Automata 1-31 1-19
and vice-versa. with Context-Free Grammars (CFG to
PDA)
36 1 Equivalence of Pushdown Automata
with Context-Free Grammars (CFG to
PDA)
37 1 Equivalence of Pushdown Automata
with Context-Free Grammars (CFG to
PDA)
14 38 1 Equivalence of Pushdown Automata 1-23 1-13
with Context-Free Grammars (PDA to
CFG)
39 2 PREFINAL EXAMINATION
20 Apply the pumping lemma for context- 15 40 1 Non Context-Free Languages 1-34 1-18
free languages 41 1 Non Context-Free Languages
42 1 Non Context-Free Languages
21 Discuss turing machines as powerful 16 43 1 Turing Machines 1-26 1-25
modelling tools. 44 1 Turing Machines
45 1 Turing Machines
22 Explain alternative definitions of turing 17 46 1 Variants of Turing Machines 1-18 1-11
machines. 47 1 Variants of Turing Machines
48 1 Variants of Turing Machines
18 49 1 Variants of Turing Machines
50 2 FINAL EXAMINATION

Reference books:
1 Sipser, Michael, Introduction to the theory of computation (2nd Ed.)
2 Hopcroft and Ullman, Introduction to automata theory, languages and computations
3 Cohen, Daniel, Introduction to computer theory
4 Denning, Dennis, and Qualitz, Machines, languages, and computation
5 Hopcroft, J.E., Motwani, R., Ullman, J.D., (2000), Introduction to automata theory ,
6 Kozen, Dexter C., (1999), Automata and computability , Springer
7 Ding-Zhu Du & Ker-I Ko, (2000), Theory of computational complexity , Wiley-
8 InterscienceJuraj, (2003), Theoretical computer science : introduction to automata,
Hromkovic,
9 computability,
Martin, complexity,
John, (2002), algorithmics,
Introduction randomization,
to languages communication,
and theory of computer and
(3rd ed.),
McGraw-Hill

APPROVED BY: Reyes, Melanie R. RELEASE DATE: 1st Term, SY 14-15

* Property of STI PAGE: 3 of 3