Automata, computability and complexity : theory and applications / Elaine Rich.
Material type:
TextPublisher: Upper Saddle River, N.J. : Pearson Prentice Hall, [2008]Producer: ©2008. Description: xx, 1099 pages : illustrations ; 25 cmContent type: - text
- unmediated
- volume
- 9780132288064
- 0132288060
- 22 511.3 R.E.A
- QA267 .R53 2008
Contents:
Finite state machines and regular languages -- Context-free languages and pushdown automata -- Turing machines and undecidability -- Complexity.
| Item type | Current library | Collection | Call number | Copy number | Status | Date due | Barcode | Course reserves |
|---|---|---|---|---|---|---|---|---|
Text Books
|
Main library Reserve | Computers & Information Technology ( Computer Science ) | 511.3 R.E.A (Browse shelf(Opens below)) | C.1 | Not for loan | 00013057 | ||
|
Text Books
|
Main library A8 | Computers & Information Technology ( Computer Science ) | 511.3 R.E.A (Browse shelf(Opens below)) | C.2 | Not for loan | 00016734 |
Browsing Main library shelves, Shelving location: A8 Close shelf browser (Hides shelf browser)
| 511.3 C.D.I Introduction to computer theory / | 511.3 J.R.D Discrete mathematics / | 511.3 L.W.M Mathematical logic : foundations for information science / | 511.3 R.E.A Automata, computability and complexity : theory and applications / | 511.3 S.V.M Mathematical theory of domains / | 511.32 C.N.F Finite ordered sets : concepts, results and uses / | 511.42 A.A.T A treatise on theory of errors and least squares adjustment for geomatic engineering students / |
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 on this title.