Languages and machines : an introduction to the theory of computer science / Thomas A. Sudkamp.
By: Sudkamp, Thomas A [author]
Language: English Publisher: Boston : Pearson Addison-Wesley, c2006Edition: Third editionDescription: xvii, 654 pages : illustrations ; 24 cmContent type: text Media type: unmediated Carrier type: volume ISBN: 0321315340; 0321322215 (alk. paper); 9780321315342Subject(s): Formal languages | Machine theory | Computational complexityDDC classification: 511.3 LOC classification: QA267.3 | .S83 2006Online resources: Table of contents| Item type | Current location | Home library | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
BOOK
|
COLLEGE LIBRARY | COLLEGE LIBRARY SUBJECT REFERENCE | 511.3 Su22 2006 (Browse shelf) | Available | CITU-CL-33670 |
Browsing COLLEGE LIBRARY Shelves , Shelving location: SUBJECT REFERENCE Close shelf browser
|
|
|
|
|
|
|
||
| 511.3 R371 2009 Automata, computability and complexity : theory and applications / | 511.3 Si75 1997 Introduction to the theory of computation / | 511.3 Si75 2006 Introduction to the theory of computation / | 511.3 Su22 2006 Languages and machines : an introduction to the theory of computer science / | 511.3 T238 1989 A modern formal logic primer / | 511.32 F9899 2016 Fuzzy sets and their applications | 511.32 K65 1988 Fuzzy sets, uncertainty, and information / |
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 for this item.