正規語言概論
Introduction to Formal Language
| 節 | 週二 | 週四 |
|---|---|---|
3 10:10–11:00 | 正規語言概論 EC122(光復) 2 節連堂 | |
4 11:10–12:00 | ||
7 15:30–16:20 | 正規語言概論 EC122(光復) |
* 根據陽明交大上課時間表所列
本課程探討計算理論的幾個課題: 自動機理論(automata theory), 正規語言與文法(formal languages and grammars), 可計算性理論(computability theory). 1. Introduction to the Theory of Computation 2. Finite Automata 3. Regular Languages and Regular Grammars 4. Properties of Regular Languages 5. Context-Free Languages 6. Simplification of Context-Free Grammars and Normal Forms 7. Pushdown Automata 8. Properties of Context-Free Languages 9. Turing Machines 10. Other Models of Turing Machines 11. A Hierarchy of Formal Languages and Automata 12. Limits of Algorithmic Computation
無
無備註
教師未提供此項資料
Homeworks 15% Midterm 40 % Final 45%
教師未提供此項資料
教師未提供此項資料
An Introduction to FORMAL LANGUAGES and AUTOMATA (5th or 6th edition) by Peter Linz
- 地點
- EC119
- 時間
- Tuesday GH
- 聯絡方式
- 教師未提供此項資料
