机读格式显示(MARC)

• 000 01680cam a2200337 a 4500

• 001 0000608989

• 003 CAL

• 005 20080317104100.0

• 008 070822r20072007cc b 001 0 eng d

• 010 __ |a 2004030342

• 020 __ |a 9787302151722

• 040 __ |a TSU |c TSU

• 041 0_ |a eng |b chi

• 050 00 |a QA267.3 |b .S83 2006

• 082 00 |a 511.3 |2 22

• 090 __ |a TP391/S943(C=3)

• 093 __ |a TP391 |2 4

• 099 __ |a CAL 022007099198

• 100 1_ |a Sudkamp, Thomas A.

• 245 10 |a Languages and machines : |b an introduction to the theory of computer science = 语言与机器 : 计算机科学理论导论 / |c Thomas A. Sudkamp.

• 246 31 |a 语言与机器 : |b 计算机科学理论导论

• 260 __ |a 北京 : 清华大学出版社, |c 2007.

• 300 __ |a xvii, 654 p. : |b ill. ; |c 25 cm.

• 440 _0 |a 大学计算机教育国外著名教材系列

• 504 __ |a Includes bibliographical references (p. 641-647) and indexes.

• 505 0_ |a 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.

• 534 __ |p Reprint. Originally published: |c Pearson/Addison-Wesley, 2006. |b 3rd ed. |z 0321322215

• 650 _0 |a Formal languages.

• 650 _0 |a Machine theory.

• 650 _0 |a Computational complexity.

• 950 __ |a JHUL |b TP391 |c S943(C=3)