000			02163nam a2200313 i 4500
003			CSPC
005			20260714102841.0
008			260714s2011 ii a 001 0 eng d
020			_a9789350141571
040			_aCSPC _beng _cCSPC _erda
050	0	0	_aQA267 _b.P362011
082	0	0	_a005.131 _bP192t _223
100	1		_aPandey, Adesh Kumar, _eauthor.
245	1	0	_aTheory of automata and computation / _cAdesh Kumar Pandey.
250			_aFirst edition.
264		1	_aNew Delhi, India : _bS.K. Kataria & Sons, _c2011 ; Reprint 2022.
300			_a315 pages : _billustrations ; _c24 cm.
336			_2rdacontent _atext
337			_2rdamedia _aunmediated
338			_2rdacarrier _avolume
500			_aIncludes index.
505	0		_aSection-A: Finite automata -- Regular expression -- Introduction to machines -- Section-B: Properties of regular sets -- Context-free grammars and languages -- Simplified context-free grammar and its normal form -- Section-C: Pushdown automata -- Properties of context-free languages -- Turing machine -- Section-D: Chomsky heirarchies -- Computability and recursive function theory.
520			_a"The book addresses a full spectrum of automata theory concepts used in computer science. Each of these concepts is presented in detail, since these concepts are basis of computer science and provide the basics for developing software techniques like designing and checking the behaviour of digital circuits, lexical-analyser of the typical compiler, and software for Natural Language Processing. To introduce the more formal aspects of Computer Science, the author has presented automata as foundation. For students who are ambitious to achieve unparalleled goals in the field of computer science, and want to develop their programming skills towards system programming, it becomes necessary that their mathematical concept are very clear"-- Preface of the book.
650		0	_aMachine theory.
650		0	_aComputational complexity.
650		0	_aRecursion theory.
942			_2ddc _n0 _cBK _iP192t _kCIR _m2011 _e23 _h005.131
999			_c32637 _d32637