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

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

Modeling:

Transition System

Petri Net

Timed Automata

(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. 1, 23:59:59

Second Assignment Due date Oct. 12, 23:59:59

Third Assignment Due date Nov. 4, 23:59:59

Fourth Assignment Due date Nov. 23, 23:59:59

Fifth and Sixth Assignment Due date Dec. 19, 23:59:59

Assignment Answer Vedios


Project

First Project: Due date Nov. 11, 23:59:59

Second Project: Due date Dec. 8, 23:59:59

Third Project: Due date 2026.1.16, 23:59:59


Links

Lecture notes by Jiacai Cui.