COSE215: Theory of Computation, 2023 Spring

Note that this page is outdated. Please refer to the recent course page.

Course Information

Course Materials

Installation of Scala and sbt

Scala is a general-purpose programming language combining object-oriented and functional programming in one concise, high-level language. Scala’s static types help avoid bugs in complex applications, and its JVM and JavaScript runtimes let you build high-performance systems with easy access to huge ecosystems of libraries.

The interactive build tool sbt is built for Scala and Java projects.

Please download and install them using the following links:

Schedule

# Date Title PDFCodeHomework
Part 0: Basic Concepts
0 03/06 Course Overview
1 03/08 Mathematical Preliminaries
2 03/13 Basic Introduction of Scala hw01
(by 03/23)
Part 1: Finite Automata
3 03/15 Deterministic Finite Automata (DFA) code
4 03/20 Nondeterministic Finite Automata (NFA) code
5 03/22 ε-Nondeterministic Finite Automata (ε-NFA) code
ex01
6 03/27 Regular Expressions and Languages code
7 03/29 Equivalence of Regular Expressions and Finite Automata code
hw02
(by 04/13)
8 04/03 Closure Properties of Regular Languages
9 04/05 The Pumping Lemma for Regular Languages
10 04/10 Equivalence and Minimization of Finite Automata
Part 2: Pushdown Automata
11 04/12 Context-Free Grammars (CFGs) and Languages (CFLs) code
12 04/17 Examples of Context-Free Grammars
13 04/19 Parse Trees and Ambiguity
04/24 Midterm Exam Lectures 1 - 13
14 04/26 Pushdown Automata (PDA) code
15 05/01 Examples of Pushdown Automata
16 05/03 Equivalence of Pushdown Automata and Context-Free Grammars
17 05/08 Deterministic Pushdown Automata (DPDA)
18 05/10 Normal Forms of Context-Free Grammars
19 05/15 Closure Properties of Context-Free Languages
20 05/17 The Pumping Lemma for Context-Free Languages hw03
(by 05/30)
Part 3: Turing Machines / Computability
21 05/22 Turing Machines (TMs) code
22 05/24 Examples of Turing Machines
23 05/29 Extensions of Turing Machines
24 05/31 The Origin of Computer Science
25 06/05 Undecidability
26 06/07 P, NP, and NP-Complete Problems
27 06/12 Course Review
06/14 Final Exam Lectures 14 - 26