跳至内容
Introduction to automata theory, languages, and computation 線上預覽
關閉線上預覽
正在查...

Introduction to automata theory, languages, and computation

作者: John E Hopcroft; Jeffrey D Ullman
出版商: Reading, Mass. : Addison-Wesley, ©1979.
叢書: Addison-Wesley series in computer science.
版本/格式:   圖書 : 英語所有版本和格式的總覽
資料庫:WorldCat
評定級別:

(尚未評分) 0 附有評論 - 成爲第一個。

主題
更多類似這樣的

 

在線上查詢

與資料的連結

在圖書館查詢

&AllPage.SpinnerRetrieving; 正在查詢有此資料的圖書館...

詳細書目

其他的實體格式: Online version:
Hopcroft, John E., 1939-
Introduction to automata theory, languages, and computation.
Reading, Mass. : Addison-Wesley, ©1979
(OCoLC)643768674
資料類型: 網際網路資源
文件類型: 圖書, 網路資源
所有的作者/貢獻者: John E Hopcroft; Jeffrey D Ullman
ISBN: 020102988X 9780201029888
OCLC系統控制編碼: 4549363
描述: x, 418 pages : illustrations ; 24 cm.
内容: Preliminaries --
Finite automata and regular expressions --
Properties of regular sets --
Context-free grammars --
Pushdown automata --
Properties of context-free languages --
Turing machines --
Undecidability --
The Chomsky hierarchy --
Deterministic context-free languages --
Closure properties of families of languages --
Computational complexity theory --
Intractable problems --
Highlights of other important language classes.
叢書名: Addison-Wesley series in computer science.
責任: John E. Hopcroft, Jeffrey D. Ullman.

評論

讀者提供的評論
正在擷取GoodReads評論...
正在擷取DOGObooks的評論

標籤

所有的讀者標籤 (2)

檢視最熱門的標籤,呈現的形式是: 標籤我的最愛清單 | 標籤雲(tag cloud)

  • jds  (由 1 個人)
  • math  (由 1 個人)
確認申請

你可能已經申請過這份資料。若還是想申請,請選確認。

連結資料


<http://www.worldcat.org/oclc/4549363>
library:oclcnum"4549363"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/4549363>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:copyrightYear"1979"
schema:creator
schema:datePublished"1979"
schema:description"Preliminaries -- Finite automata and regular expressions -- Properties of regular sets -- Context-free grammars -- Pushdown automata -- Properties of context-free languages -- Turing machines -- Undecidability -- The Chomsky hierarchy -- Deterministic context-free languages -- Closure properties of families of languages -- Computational complexity theory -- Intractable problems -- Highlights of other important language classes."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/9643580>
schema:inLanguage"en"
schema:name"Introduction to automata theory, languages, and computation"@en
schema:publisher
schema:url
schema:workExample

Content-negotiable representations

關閉視窗

請登入WorldCat 

没有帳號嗎?你可很容易的 建立免費的帳號.