|
|
|
|
| LEADER |
01615nam a2200289 a 4500 |
| 001 |
13821912 |
| 008 |
100928m20092006maua b 001 0 eng d |
| 010 |
|
|
|a 2004030342
|
| 020 |
|
|
|a 9788131714751
|
| 020 |
|
|
|a 0321322215 (alk. paper)
|
| 040 |
|
|
|a DLC
|c DLC
|d DLC
|d DB-DhAAL
|
| 082 |
0 |
0 |
|a 511.3
|2 22
|
| 100 |
1 |
|
|a Sudkamp, Thomas A.
|
| 245 |
1 |
0 |
|a Languages and machines :
|b an introduction to the theory of computer science /
|c Thomas A. Sudkamp.
|
| 250 |
|
|
|a 3rd ed.
|
| 260 |
|
|
|a Boston ;
|a India :
|b Pearson Addison-Wesley,
|c c2006.[Impression 2009]
|
| 300 |
|
|
|a xvii, 654 p. :
|b ill. ;
|c 24 cm.
|
| 504 |
|
|
|a Includes bibliographical references (p. 641-647) and index.
|
| 541 |
1 |
|
|e 00021093
|
| 505 |
0 |
|
|a 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.
|
| 650 |
|
0 |
|a Formal languages.
|
| 650 |
|
0 |
|a Machine theory.
|
| 650 |
|
0 |
|a Computational complexity.
|
| 852 |
4 |
|
|a Ayesha Abed Library
|j General Shelf.
|
| 942 |
0 |
0 |
|0 2
|
| 999 |
|
|
|c 9569
|d 9569
|
| 952 |
|
|
|0 0
|1 0
|2 ddc
|4 0
|6 511_300000000000000_SUD_2009
|7 0
|9 12150
|a BRACUL
|b BRACUL
|c GEN
|d 2010-09-28
|l 8
|m 45
|o 511.3 SUD
|p 3010021093
|r 2023-03-02
|s 2023-03-02
|t 1
|w 2010-09-28
|y BK
|