CS 335A -- Theory of Computation -- Fall 2013

Javadoc for Finite Automata Package

Handouts:

Homework/Reading Assignments:

Week

Number

Due Date
Assignment
1
 
F 9/6
Read Chapter 0.
2
 
W 9/11
Read Section 1.1
 
F 9/13
Read Section 1.2
1
F 9/13
Chap 0 #2-8; Chap 1 #1, 2, 3, 5c, 5d, 6a, 6b
3
 
W 9/18
Read Section 1.3
2
F 9/20

Chap 1 #6e, 6h, 6n, 7b, 7g, 7h, 9a, 10b, 12, 14, 16

4
 
M 9/23
Read Section 1.4
5
3
M 9/30
Chap 1 #22, 28ab (by any method), 29ab, 31, 36, 46abc, 49
   
M 9/30
Read Section 2.1
6
 
W 10/9
Read Sections 2.1 - 2.2
   
F 10/11
Read Section 2.3
 
4
F 10/11
Chap 2 #1, 3, 4, 6ab, 9, 14, 16

Tentative schedule:

week of

day

assignment

topic

Sep 2

Mon

 

Introduction

(week 1)

Wed

0.1, 0.2

Mathematical Terminology

 

Thu

 

Lab 1: Alphabet 1 -- due Wed 9/11

 

Fri

0.3, 0.4

Definitions, Theorems, Proofs

Sep 9

Mon

1.1

Finite Automata

(week 2)

Wed

1.1

Finite Automata

 

Thu

 

Lab 2 assignment -- due Wed 9/18

source code: Alphabet, cont.

 

Fri

1.2

Nondeterminism

Sep 16

Mon

1.2

Nondeterminism

(week 3)

Wed

1.3

Regular Expressions

 

Thu

 

no class

 

Fri

1.3

Regular Expressions

Sep 23

Mon

1.4

Nonregular Languages

(week 4)

Wed

1.4

Nonregular Languages

 

Thu

 

Lab 3:  DFA 1 (Lab 3 & 3b Documents Here...)

 

Fri

1.4

Nonregular Languages

Sep 30

Mon

2.1

Context-free Grammars

(week 5)

Wed

 

Review

 

Thu

 

Review

 

Fri

 

Exam 1, through Chapter 1

Oct 7

Mon

2.1

Context-free Grammars

(week 6)

Wed

2.2

Pushdown Automata

 

Thu

 

Lab 3b: DFA "accepts" method  

 

Fri

2.3

Non-context-free Languages

Oct 14

Mon

 

*** Fall Break ***

(week 7)

Wed

2.3

Non-context-free Languages

 

Thu

 

Lab 4: DFA 1 cont.

 

Fri

3.1

Turing Machines

Oct 21

Mon

3.2

Variants of Turing Machines

(week 8)

Wed

3.3

The Definition of Algorithm

 

Thu

 

Lab 5: DFA 2

 

Fri

3.3

The Definition of Algorithm

Oct 28

Mon

4.1

Decidable Languages

(week 9)

Wed

 

review

 

Thu

 

Lab 6: DFA 3

 

Fri

 

Exam 2, Chapters 2 & 3