Languages and machines [[Book] :]an introduction to the theory of computer science / Thomas A. Sudkamp.
Von: Sudkamp, Thomas A.
Mitwirkende(r): Sudkamp, Thomas A.
Materialtyp:
BuchVerlag: Boston : Pearson Addison-Wesley, c2006Auflage: 3rd ed.Beschreibung: xvii, 654 p. : ill. ; 24 cm.ISBN: 0321322215 .Schlagwörter: Formal languages | Machine theory | Computational complexityDDC-Klassifikation: 511.3 Online-Ressourcen: Table of contents
Inhalte:
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.
| Medientyp | Aktueller Standort | Signatur | Exemplarnr. | Status | Fälligkeitsdatum |
|---|---|---|---|---|---|
Books
|
6october 1104 | 511.3 SL (Regal durchstöbern) | 1 | Verfügbar |
Regale von 6october durchstöbern , Standort: 1104 Regal ausblenden
|
|
|
|
|
|
|
||
| 511.3 S I Introduction to the theory of computation | 511.3 S I Introduction to the theory of computation | 511.3 SI Introduction to the theory of computation | 511.3 SL Languages and machines | 511.32 GF Fuzzy sets and fuzzy logic | 511.322 KF fuzzy sets and fuzzy logic theory and applications. | 511.322 M.I Introduction to languages and the theory of computation |
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.
All Ages.
Es gibt keine Kommentare zu diesem Titel.