1. 1 Formal Languages & Automata

2. 2 A formal language: Is an abstraction of the general characteristics of programming languages. Consists of a set of symbols and some formation rules by which these symbols can be combined into sentences.

3. 3 Formal Languages & Automata An automaton: Is a construct that possesses all the indispensable features of a digital computer. Accepts input, produces output, may have some temporary storage, and can make decisions in transforming the input into the output.

4. 4 Formal Languages & Automata Computational power Non-computable functions Computational complexity Intractable problems An introduction to the fundamental ideas and models underlying computing.

5. 5 Formal Languages & Automata Digital design Programming languages Compilers Some immediate and important applications.

6. 6 Formal Languages & Automata Assessment: Midterm exam: 30% Final exam: 60% Presentation & assignments: 10%

7. 7 Formal Languages & Automata References: 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