• View
• Edit
• History
• Print

CSI3109 Automata and Formal Languages

This course provides formal language and automata theory. We study the fundamental knowledge on computation and computability. In particular, we examine finite-state automata (regular languages), pushdown automata (context-free languages) and Turing machines (unrestricted languages).