书目信息 |
| 书名： | Languages and machines | |
| 作者： | Thomas A. Sudkamp. | |
| 分册号： | ||
| 分册名： | 出版地： | 北京 : |
|
| 出版社： | 清华大学出版社 | |
| 出版时间： | 2007. | |
| 页数： | xvii, 654 p. : | |
| 开本： | 23 cm. | |
| 丛书名： | 大学计算机教育国外著名教材系列 | |
| 中图分类号： | ||
| 科图分类号： | ||
| 其他分类号： | H31:TP3 | |
| 主题词： | ||
| 电子资源： | ||
| 000 | 03781cam a2201321 a 4500 | |
| 001 | 00000213484 | |
| 003 | CAL | |
| 005 | 20140324105359.65 | |
| 008 | 070822r20072006cc a b 001 0 eng d | |
| 020 | @a9787302151722. | |
| 040 | @aTSU@cTSU | |
| 041 | 0 | @aeng@bchi |
| 050 | 4 | @aQA267.3@b.S83 2007 |
| 082 | 04 | @a511.3@222 |
| 093 | @aTP391@24 | |
| 093 | @aTP301@24 | |
| 099 | @dH31:TP3@e20=3 | |
| 100 | 1 | @aSudkamp, Thomas A. |
| 245 | 10 | @aLanguages and machines :@ban introduction to the theory of computer science = 语言与机器 : 计算机科学理论导论 / @cThomas A. Sudkamp. |
| 246 | 31 | @a语言与机器 :@b计算机科学理论导论 |
| 250 | @a3rd ed. | |
| 260 | @a北京 :@b清华大学出版社,@c2007. | |
| 300 | @axvii, 654 p. :@bill. ;@c23 cm. | |
| 440 | 0 | @a大学计算机教育国外著名教材系列 |
| 504 | @aIncludes bibliographical references (p. 641-647) and index. | |
| 505 | 0 | @aIntroduction -- Mathematical preliminaries -- Languages -- Context-free grammars -- Normal forms for context-free grammars -- Finite automata -- Properties of regular languages -- Pushdown automata and context-free languages -- Turing machines -- Turing computable functions -- The Chomsky hierarchy -- Decision problems and the Church-Turing thesis -- Undecidability -- Mu-recursive functions -- Time complexity -- P, np and cook's theorem -- Np-complete problems -- Additional complexity classes -- Parsing: an introduction -- Ll(k) grammars -- Lr(k) grammars. |
| 534 | @pReprint. Originally published:@cBoston :Pearson Addison-Wesley, c2006.@z0321322215. | |
| 650 | 0 | @aComputational complexity. |
| 650 | 0 | @aFormal languages. |
| 650 | 0 | @aMachine theory. |
| 905 | @a241250 | |
| 920 | @a211010@z2 | |
| 920 | @a211260@z1 | |
| 920 | @a211060@z1 | |
| 920 | @a245010@z2 | |
| 920 | @a211130@z1 | |
| 920 | @a234030@z1 | |
| 920 | @a261030@z2 | |
| 920 | @a222010@z1 | |
| 920 | @a242030@z2 | |
| 920 | @a251010@z1 | |
| 920 | @a241031@z2 | |
| 920 | @a231030@z1 | |
| 920 | @a244290@z1 | |
| 920 | @a244180@z2 | |
| 920 | @a242020@z1 | |
| 920 | @a242170@z1 | |
| 920 | @a232010@z2 | |
| 920 | @a231220@z2 | |
| 920 | @aF44010@z1 | |
| 920 | @a242250@z2 | |
| 920 | @a221020@z1 | |
| 920 | @a244020@z2 | |
| 920 | @a211070@z2 | |
| 920 | @a243325@z1 | |
| 920 | @a232030@z2 | |
| 920 | @a211030@z2 | |
| 920 | @a212010@z1 | |
| 920 | 1 | @a234050@z1 |
| 920 | 1 | @a234010@z1 |
| 920 | 1 | @a234080@z1 |
| 920 | 1 | @a211080@z1 |
| 920 | 1 | @a211111@z1 |
| 920 | 1 | @a211261@z1 |
| 920 | 1 | @a211270@z1 |
| 920 | 1 | @a251020@z1 |
| 920 | 1 | @a244450@z1 |
| 920 | 1 | @a244458@z1 |
| 920 | 1 | @a231060@z1 |
| 920 | 1 | @a231010@z1 |
| 920 | 1 | @a244055@z1 |
| 920 | 1 | @a245020@z1 |
| 920 | 1 | @a244370@z1 |
| 920 | 1 | @a241061@z1 |
| 920 | 1 | @a242150@z1 |
| 920 | 1 | @a223060@z1 |
| 920 | 1 | @a223025@z1 |
| 920 | 1 | @a243031@z1 |
| 920 | 1 | @a235020@z1 |
| 920 | 1 | @a242450@z1 |
| 920 | 1 | @a244021@z1 |
| 920 | 1 | @a236120@z1 |
| 920 | 1 | @a242280@z1 |
| 920 | 1 | @a232140@z1 |
| 920 | 1 | @a211168@z1 |
| 920 | 1 | @a221060@z1 |
| 920 | 1 | @a221063@z1 |
| 920 | 1 | @a232330@z1 |
| 920 | @a211040@z2 | |
| 920 | 1 | @a233104@z1 |
| 920 | 1 | @a232151@z1 |
| 920 | 1 | @a223101@z1 |
| 920 | @a211020@z2 | |
| 920 | 1 | @a232020@z1 |
| 920 | 1 | @a244030@z1 |
| 920 | 1 | @a242050@z1 |
| 920 | 1 | @a242120@z1 |
| 920 | 1 | @a241220@z1 |
| 920 | 1 | @a261050@z1 |
| 920 | 1 | @a253190@z1 |
| 920 | 1 | @a213015@z1 |
| 920 | 1 | @a232181@z1 |
| 920 | 1 | @a233120@z1 |
| 920 | 1 | @a235170@z1 |
| 920 | @a232090@z2 | |
| 920 | @a262010@z2 | |
| 920 | @a244070@z1 | |
| 920 | @a244010@z1 | |
| 920 | @a233020@z2 | |
| 920 | @a235010@z2 | |
| 920 | @a221120@z1 | |
| 920 | @a244050@z1 | |
| 998 | @aTSU | |
| Languages and machines : : an introduction to the theory of computer science = 语言与机器 : 计算机科学理论导论 / / Thomas A. Sudkamp.-3rd ed.-北京 : : 清华大学出版社, , 2007. |
| xvii, 654 p. : : ill. ; ; 23 cm.- (大学计算机教育国外著名教材系列) |
| Includes bibliographical references (p. 641-647) and index.-Introduction -- Mathematical preliminaries -- Languages -- Context-free grammars -- Normal forms for context-free grammars -- Finite automata -- Properties of regular languages -- Pushdown automata and context-free languages -- Turing machines -- Turing computable functions -- The Chomsky hierarchy -- Decision problems and the Church-Turing thesis -- Undecidability -- Mu-recursive functions -- Time complexity -- P, np and cook's theorem -- Np-complete problems -- Additional complexity classes -- Parsing: an introduction -- Ll(k) grammars -- Lr(k) grammars. |
| ISBN 9787302151722. |
| ● |
| 相关链接 |
正题名：Languages and machines
索取号：H31:TP3/20=3
预约/预借
| 序号 | 登录号 | 条形码 | 馆藏地/架位号 | 状态 | 备注 |
| 1 | 1241125 | 212411255 | 样本书库/4110970405/ [索取号:H31:TP3/20=3] | 在馆 | |
| 2 | 1241126 | 212411264 | 西文书库/4110970405/ [索取号:H31:TP3/20=3] | 在馆 | |
| 3 | 1241127 | 212411273 | 西文书库/4110970405/ [索取号:H31:TP3/20=3] | 在馆 | |
| 4 | 1241128 | 212411282 | 西文书库/4110970405/ [索取号:H31:TP3/20=3] | 在馆 | |
| 5 | 1241129 | 212411291 | 西文书库/4110970405/ [索取号:H31:TP3/20=3] | 在馆 |