Formal Languages and Automata

(形式语言与自动机)

 


[Course Information] [Slides] [Assignments] [Links]
Course Information
Slides (Slides will be available one week before the class)

Class Intro

Preliminary Knowledge

Models:

Finite Automata

Regular Expression

Context Free Grammar

Pushdown Automata

Properties of CFL

Turing Machine

Modeling:

Transition System

Petri Net

Timed Automata

Special Tutorials:

Decidability, Complexity (P, NP, NPC and related)

(Special thanks to Prof. Jeffery Ullman and Prof. Xuandong Li for their permissions of using and adjusting their slides)


Assignments

First assignment: Due date Oct. 18th.

Second assignment: Due date Nov. 15th.

Third assignment: Due date Dec. 17th.


Project

Project Description& Submission Site (Updated on Dec. 3rd): Due date Jan. 3rd.


Links