《自動機理論、語言和計算導論》閱讀筆記:p215-p351

codists發表於2024-05-02

《自動機理論、語言和計算導論》學習第 11 天,p215-p351總結,總計 37 頁。

一、技術總結

1.constrained problem

2.Fermat's lats theorem

Fermat's Last Theorem states that no three positive integers a, b and c satisfy the equation a^n + b^n = c^n for any integer value of n greater than 2。

二、英語總結

1.tantamount

(1)tant: as much, the same(from tantus, from tam(so),參考tandem)。

(2)amount

(3)tantamount: adj. being the same as。語法結構: be tantamount to sth。

p315, This question is tantamount to the question of what computers can do, since recognizing the strings in a language is a formal way of expressing any problem, and solving a problem is a reasonable surrogate for what it is that computers do.

2.surrogate

(1)su-:the assimilated form of sub-(in the place of)。

(2)sogare: to ask, to propose。

(3)surrogate: c. sth that is used to replace sth else。

3.venerable

(1)venus: to worship, to revere

(2)venerable: adj. deserving respect。

4.ultimate

(1)*ulter: means "beyond", from the suffixed form of *al-(beyond)

(2) ultimus: superlative form of *alter。means "farthest, lats"

(3)ultimate: adj. most extreme(at the fathest point,極端) or important。

三、其它

無。

四、參考資料

1. 程式設計

(1)Eric S.Roberts,《自動機理論、語言和計算導論(英文版.第3版)》:https://book.douban.com/subject/2274854/

2. 英語

(1)Etymology Dictionary:https://www.etymonline.com

(2) Cambridge Dictionary:https://dictionary.cambridge.org

歡迎搜尋及關注:程式設計人(a_codists)

相關文章