跳到内容
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.
版本/格式:   book_printbook : 英语查看所有的版本和格式
数据库: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
rdf:typeschema:MediaObject
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: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:isPartOf
schema:name"Introduction to automata theory, languages, and computation"@en
schema:publication
schema:publisher
schema:workExample
wdrs:describedby

Content-negotiable representations

关闭窗口

请登入WorldCat 

没有张号吗?很容易就可以 建立免费的账号.