Amazon cover image
Image from Amazon.com
Image from Google Jackets

Automata, computability and complexity : theory and applications Elaine Rich

By: Material type: TextTextLanguage: English Publication details: Noida : Pearson Education, 2012.Description: xx, 1099 pages : illustrations ; 25 cmISBN:
  • 9788131788226
Subject(s): DDC classification:
  • 511.3 RIC
Contents:
Finite state machines and regular languages -- Context-free languages and pushdown automata -- Turing machines and undecidability -- Complexity.
Summary: Combining classic theory with unique applications, this crisp narrative is supported by abundant examples and clarifies key concepts by introducing important uses of techniques in real systems. Broad-ranging coverage allows instructors to easily customize course material to fit their unique requirements.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode
General Books General Books CUTN Central Library Sciences Non-fiction 511.3 RIC (Browse shelf(Opens below)) Available 36639
General Books General Books CUTN Central Library Sciences Non-fiction 511.3 RIC (Browse shelf(Opens below)) Available 36640

Finite state machines and regular languages --
Context-free languages and pushdown automata --
Turing machines and undecidability --
Complexity.

Combining classic theory with unique applications, this crisp narrative is supported by abundant examples and clarifies key concepts by introducing important uses of techniques in real systems. Broad-ranging coverage allows instructors to easily customize course material to fit their unique requirements.

There are no comments on this title.

to post a comment.

Powered by Koha