000			01709nam a2200229Ia 4500
003			NULRC
005			20250520102718.0
008			250520s9999 xx 000 0 und d
020			_a9788180940767
040			_cNULRC
050			_aQA 267 .A34 2010
100			_aAcharjya, D. P. _eauthor
245		0	_aTheory of computation / _cD. P. Acharjya
260			_aChennai, India : _bMJP Publishers, _cc2010
300			_axix, 396 pages : _billustrations ; _c25 cm.
365			_bUSD3335
504			_aIncludes bibliographical references and index.
505			_a1. 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.
520			_aTheory 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.
650			_aCOMPUTATIONAL COMPLEXITY -- MATHEMATICS
942			_2lcc _cBK
999			_c13577 _d13577