Automata, computability and complexity : theory and applications / Elaine Rich.
Material type:
TextPublisher: Upper Saddle River, N.J. : Pearson Prentice Hall, [2008]Copyright date: c2008Description: xx, 1099 pages : illustrations ; 25 cmContent type: - text
- unmediated
- volume
- 0132288060
- 9780132288064
- 511.3 RIC 22
Contents:
Finite state machines and regular languages -- Context-free languages and pushdown automata -- Turing machines and undecidability -- Complexity.
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
NB - Book (Non borrowing)
|
Central Library First floor | Baccah | 511.3 RIC (Browse shelf(Opens below)) | Not for loan | 000022407 | |||||||||||||
Book - Borrowing
|
Central Library First floor | Baccah | 511.3 RIC (Browse shelf(Opens below)) | Available | 000022406 | |||||||||||||
|
Book - Borrowing
|
Central Library First floor | Baccah | 511.3 RIC (Browse shelf(Opens below)) | Available | 000022405 |
Total holds: 0
Browsing Central Library shelves,Shelving location: First floor Close shelf browser (Hides shelf browser)
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.
Log in to your account to post a comment.