Amazon cover image
Image from Amazon.com

Theory of computation / D. P. Acharjya

By: Material type: TextTextPublication details: Chennai, India : MJP Publishers, c2010Description: xix, 396 pages : illustrations ; 25 cmISBN:
  • 9788180940767
Subject(s): LOC classification:
  • QA 267 .A34 2010
Contents:
1. Mathematical preliminaries -- 2. Finite state automata -- 3. Grammar and Chomsky classification -- 4. Regular languages and expressions -- 5. Context-free languages -- 6. Pushdown automata -- 7. Turing machine -- 8. LR(k) and LL(k) grammar -- 9. Computability and undecidability -- 10. NP-Completeness.
Summary: Theory of computation is the scientific discipline concerned with the study of general properties of computation and studies the inherent possibilities and limitations of efficient computation that makes machines more intelligent and enables them to carry out intellectual processes. This book deals with all those concepts by developing the standard mathematical models of computational devices, and by investigating the cognitive and generative capabilities of such machines. The book emphasizes on mathematical reasoning and problem-solving techniques that penetrate computer science. Each chapter gives a clear statement of definition and thoroughly discusses the concepts, principles and theorems with illustrative and other descriptive materials.
Item type: Books
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 Home library Collection Call number Copy number Status Date due Barcode
Books Books National University - Manila LRC - Graduate Studies General Circulation Gen. Ed. - CCIT GC QA 267 .A34 2010 (Browse shelf(Opens below)) c.1 Available NULIB000011336

Includes bibliographical references and index.

1. Mathematical preliminaries -- 2. Finite state automata -- 3. Grammar and Chomsky classification -- 4. Regular languages and expressions -- 5. Context-free languages -- 6. Pushdown automata -- 7. Turing machine -- 8. LR(k) and LL(k) grammar -- 9. Computability and undecidability -- 10. NP-Completeness.

Theory of computation is the scientific discipline concerned with the study of general properties of computation and studies the inherent possibilities and limitations of efficient computation that makes machines more intelligent and enables them to carry out intellectual processes. This book deals with all those concepts by developing the standard mathematical models of computational devices, and by investigating the cognitive and generative capabilities of such machines. The book emphasizes on mathematical reasoning and problem-solving techniques that penetrate computer science. Each chapter gives a clear statement of definition and thoroughly discusses the concepts, principles and theorems with illustrative and other descriptive materials.

There are no comments on this title.

to post a comment.