Theory of computation /
D. P. Acharjya
- Chennai, India : MJP Publishers, c2010
- xix, 396 pages : illustrations ; 25 cm.
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.