Formal Languages and Automata

(形式语言与自动机)

 


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

Class Intro

Models:

Finite Automata

Regular Expression

Context Free Grammar

Pushdown Automata

Properties of CFL

Turing Machine

Modeling:

Transition System: TBD

Petri Net: TBD

Timed Automata: TBD

Special Tutorials:

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

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


Assignments

First assignment Due date Sep. 22, 23:59:59

Second assignment Due date Sep. 30, 23:59:59

Third assignment Due date Oct. 20, 23:59:59

Fourth assignment Due date Oct. 28, 23:59:59

Fifth assignment: TBD

Sixth assignment: TBD

Assignment Answer Videos: TBD


Project

Project Description: TBD


Links

Lecture notes by Jiacai Cui.