Automata, computability and complexity : theory and applications / Elaine Rich.
By: Rich, Elaine [author]
Language: English Publisher: Upper Saddle River, N.J. : Pearson Prentice Hall, c2009Description: xx, 1097 pages : illustrations ; 25 cmContent type: text Media type: unmediated Carrier type: volume ISBN: 0132346176; 9780132346177Subject(s): Machine theory | Computable functions | Computational complexity | Electronic data processingDDC classification: 511.3 LOC classification: QA267 | .R53 2008
Contents:
Finite state machines and regular languages -- Context-free languages and pushdown automata -- Turing machines and undecidability -- Complexity.
Item type | Current location | Home library | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
![]() |
COLLEGE LIBRARY | COLLEGE LIBRARY SUBJECT REFERENCE | 511.3 R371 2009 (Browse shelf) | Available | CITU-CL-38193 |
Total holds: 0
Browsing COLLEGE LIBRARY Shelves , Shelving location: SUBJECT REFERENCE Close shelf browser
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
511.3 M877 2010 Algorithms, languages, automata, and compilers : a practical approach / | 511.3 P197 1994 Computational complexity / | 511.3 R371 2008 Automata, computability and complexity : theory and applications / | 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 / |
Includes bibliographical references and index.
Finite state machines and regular languages -- Context-free languages and pushdown automata -- Turing machines and undecidability -- Complexity.
There are no comments for this item.