|
國立雲林科技大學授課科目教學計畫表 |
P.1 |
|
科目名稱: 邏輯與正規語言 | ||||||
|
學期課號：5216 |
講授-實習-學分：3-0-3 | |||||
|
學年：94 |
學期：2 |
系所年級：運算所研一 |
教師：黃永廣 | |||
|
教學目標： | ||||||
|
本課程的目標是讓學生瞭解邏輯程式語言Prolog與正規語言的基礎觀念、並利用Turtle/Logo圖學與L-systems應用在設計工作上。 | ||||||
|
Reference Websites: | ||||||
| - SWI-Prolog. A popular public domain Prolog from the Netherlands. http://www.swi-prolog.org/ | ||||||
|
- Warick University's computer science course Automata and Formal Languages | ||||||
| - David Atkin's course Automata Theory in the University of Oregon | ||||||
| - Gordon Royle's course on Prolog Programming in the University of Western Australia | ||||||
|
教學活動： | ||||||
|
課堂講授與討論 | ||||||
|
| ||||||
|
評量方式： | ||||||
|
1.作業 80% | ||||||
|
2.期末專題書面與口頭報告 20% | ||||||
|
| ||||||
|
教科書及參考書（請依作者，書名，版次，出版人，出版地，出版年月，起訖頁次等順序填寫）： | ||||||
|
教科書: Sipser Michael, Introduction to the Theory of Computation, PWS Publishing Company, 1997. 新月代理 | ||||||
|
參考書: Sudkamp, Thomas A. (1997). Languages and Machines (2nd). Addison Wesley.Royle, G. (1999). Logic Programming Notes. Bratko, Prolog Programming for Artificial Intelligence (3rd edition), Addison-Wesley, 2000. Kelly, John. (1997). The Essence of Logic. Prentice Hall. 華通代理. Mitchell, William. 劉育東譯. 建築的設計思考:設計、運算、與認知. | ||||||
|
其他說明：(上課時間、Office Hours、教室…) | ||||||
|
上課時間： 星期一 9:10-12:00 | ||||||
|
Office hours： 星期一、三16:00-17:00 | ||||||
|
學程召集人： |
|
填表教師： |
黃永廣 | |||
|
或系所主管 |
嚴真 |
94年 12 月 15 日 | ||||
註：請授課教師依教學大綱填寫本表，並分送課程所屬學程（或系所）及上課班級學生。
|
國立雲林科技大學授課科目教學計畫表 |
P.2 |
科目名稱: 邏輯與正規語言
|
週次 |
上課日期 |
教 學 與 作 業 進 度 |
備 註 |
|
1 |
Finite automata, definition, design | ||
|
2 |
Deterministic and non-deterministic FA, their equivalence | ||
|
3 |
Regular operations and closure | ||
|
4 |
Regular expressions and languages, non-regular languages | ||
|
5 |
Equivalence between regular language and finite automaton, pumping lemma | ||
|
6 |
Context-free grammars, design | ||
|
7 |
Ambiguity, Chomsky normal form |
||
|
8 |
Non-context free languages, pumping lemma | ||
|
9 |
Pushdown automata, converting CFG to PDA | ||
|
10 |
Turing machines | ||
|
11 |
Propositional logic | ||
|
12 |
Predicate logic |
||
|
13 |
Prolog, substitutions and unification | ||
|
14 |
Turtle/Logo graphics | ||
|
15 |
Herbrand's theorem and SLD resolution | ||
|
16 |
L-systems | ||
|
17 |
Negative information, fixed-point modelling | ||
| 18 | Non-logical construct in Prolog | ||
|
|
|||
|
|