正規語言概論(英文授課)
Introduction to Formal Language
學期
106-2
學分
3
學分
當期課號
1205
永久課號
DCP3122
開課單位
資訊學院共同課程
授課教師
曾文貴
校區
光復
類別
必修
上課時間表
| 節 | 週二 | 週四 |
|---|---|---|
3 10:10–11:00 | 正規語言概論(英文授課) EC122 2 節連堂 | |
4 11:10–12:00 | ||
7 15:30–16:20 | 正規語言概論(英文授課) EC122 |
* 根據陽明交大上課時間表所列
概述
(1) To teach formalization of computation problems and and abstraction of modern computers. (2) To study the computing power of modern computers (3) To classify the hardness levels of computing problems.
先修科目
(1) Discrete mathematics (2) Basic programming
教學方式
Class lectures
評分方式
1. Homework 25% 2. Midterm Exam(twice) 50% 3. Final Exam 25%
週次計畫
| 週次 | 主題 |
|---|---|
| 第 1 週 | Introduction |
| 第 2 週 | Finite automata (I) |
| 第 3 週 | Finite automata (II) |
| 第 4 週 | Regular languages and regular grammars |
| 第 5 週 | Properties of regular languages |
| 第 6 週 | Midterm I |
| 第 7 週 | Context-free languages (I) |
| 第 8 週 | Context-free languages (II) |
| 第 9 週 | Simplification of context-free grammars and normal forms |
| 第 10 週 | Pushdown automata |
| 第 11 週 | Properties of context-free grammars |
| 第 12 週 | Midterm II |
| 第 13 週 | Turing machines |
| 第 14 週 | Other models of Turing machines |
| 第 15 週 | Limit of algorithmic computation (I) |
| 第 16 週 | Limits of algorithmic computation (II) |
| 第 17 週 | An overview of computational complexity |
| 第 18 週 | Final |
教科書
Peter Linz, An Introduction to Formal Languages and Automata (6th ed.), Jones & Bartlett Learning. (Previous editions are ok.)
Office Hours
- 地點
- Teacher: EC238 TA: EC229A
- 時間
- Office hours: (1) 2:30pm-3:30pm, Tuesday; 4:30pm-5:30pm Thursday. (2) Appointment by emails TA office hours: Amir Rezapour (1) 1FG,3FG at EC229A
- 聯絡方式
- (03)5712121 ext 31548 wgtzeng@cs.nctu.edu.tw