Automata and Formal Language
Quan Thanh Tho
qttho@dit.hcmut.edu.vn
Course Overview
An introduction to the fundamental theories
and algorithms for computing on digital
computer.
–Automation: A model producing input from
acceptable output based on self-made decision
–Formal Language: An abstraction of programming
language syntax.
Course Outline
Chapter 1: Introduction
Chapter 2: Finite Automata
Chapter 3: Regular Language and Regular Grammar
Chapter 4: Properties of Regular Language
Chapter 5: Context-Free Grammar
Chapter 6: Simplification of Context-Free Grammar
Chapter 7: Pushdown Automata
Reading Materials
•Giáo trình lý thuyết automat và ngôn ngữ hình
thức.
Hồ Văn Quân
•An introduction to formal languages and
automata.
Peter Linz
•Introduction to automata theory, languages, and
computation.
John Hopcroft & Jeffrey Ullman
Assessment
Assignment: 30%
Final Exam: 70%