Automata, computability and complexity : theory and applications
Material type: TextPublication details: New Delhi : Pearson, c2008.Description: xx, 1099 p. : ill. ; 25 cmISBN:- 9788131788226
- 511.3 RIC-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 | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
Books | IIITD Reference | Mathematics | REF 511.3 RIC-A (Browse shelf(Opens below)) | Available | 001247 | ||
Books | IIITD General Stacks | Mathematics | 511.3 RIC-A (Browse shelf(Opens below)) | Available | 001248 |
Total holds: 0
Browsing IIITD shelves, Shelving location: Reference, Collection: Mathematics Close shelf browser (Hides shelf browser)
REF 511.3 LIN-B Bayesian inference | REF 511.3 MAR-F First order mathematical logic | REF 511.3 PAP-C Computational complexity | REF 511.3 RIC-A Automata, computability and complexity : | REF 511.3 ROG-T Theory of recursive functions and effective computability | REF 511.3 RUC-I Infinity and the mind : the science and philosophy of the infinite | REF 511.3 SCH-L Logic for computer scientists |
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.