FEEDBACK Smiley face
Normal view MARC view ISBD view

Automata, computability and complexity : theory and applications

By: Rich, Elaine.
Material type: materialTypeLabelBookPublisher: New Delhi : Pearson, c2008Description: xx, 1099 p. : ill. ; 25 cm.ISBN: 9788131788226.Subject(s): Machine theory | Computable functions | Computational complexity | Electronic data processing
Contents:
Finite state machines and regular languages -- Context-free languages and pushdown automata -- Turing machines and undecidability -- Complexity.
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
Books Books IIITD
Reference
Mathematics REF 511.3 RIC-A (Browse shelf) Not For Loan 001247
Books Books IIITD
General Stacks
Mathematics 511.3 RIC-A (Browse shelf) Available 001248
Total holds: 0
Browsing IIITD Shelves , Shelving location: Reference , Collection code: Mathematics Close 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 : 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 for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in