課程目標與要求 目標:使學生能瞭解各種正規語言 (包括 regular與 context-free language)與自動機 (包括 finite automata, pushdown automata, 與 Turing machine)並能瞭解基本的計算理論。
成績評定:期中考 (35%)、期末考 (35%)、出席(15%)、作業 (15%)。
教科書: Peter Linz, "An Introduction to Formal Languages and Automata", fourth edition, Jones and Bartlett Publishers, 2006
課程大綱 Introduction to the Theory of Computation Finite Automata Regular Languages and Regular Grammars Properties of Regular Languages Context-Free Languages Simplification of Context-Free Grammars and
Normal Forms Pushdown Automata Properties of Context-Free Language
Top Related