Languages and machines : an introduction to the theory of computer science / Thomas A. Sudkamp.
Material type:
TextPublication details: Boston : Pearson Addison-Wesley, 2006.Edition: 3rd edDescription: xvii, 654 p. : ill. ; 24 cmISBN: - 0321322215
- 9780321322210
- 511.3 21 Su22l 2006
| Item type | Current library | Call number | Copy number | Status | Notes | Date due | Barcode | |
|---|---|---|---|---|---|---|---|---|
| LIBRO | SEDE MACHALÍ | 511.3 Su22l 2006 (Browse shelf(Opens below)) | 1 | Available | Adquirido el año 2015 | 010401-030101-007139 | ||
| LIBRO | SEDE MACHALÍ | 511.3 Su22l 2006 (Browse shelf(Opens below)) | 2 | Available | Adquirido el año 2015 | 010401-030101-007140 |
Browsing SEDE MACHALÍ shelves Close shelf browser (Hides shelf browser)
| 511.3 H791i 2001 Introduction to automata theory, languages, and computation / | 511.3 H791i 2001 Introduction to automata theory, languages, and computation / | 511.3 Su22l 2006 Languages and machines : an introduction to the theory of computer science / | 511.3 Su22l 2006 Languages and machines : an introduction to the theory of computer science / | 511.32 G216p 2003 Problemas resueltos de matemática discreta / | 511.8 B736f 1997 Fundamentos de algoritmia / | 511.8 B736f 1997 Fundamentos de algoritmia / |
Includes bibliographical references (p. 641-647) and index.
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.
There are no comments on this title.