000			01673nam a2200241 a 4500
001			vtls000002103
003			VRT
005			20250102223854.0
008			081117s1997 nyua |b 001 0 eng
020			_a0471137723
039		9	_a201402040103 _bVLOAD _c201007271055 _dmalmash _c200811221004 _dvenkatrajand _c200811171125 _dNoora _y200811171125 _zNoora
050	0	4	_aQA76.5 _b.C558 1997
100	1		_aCohen, Daniel I. A., _d1946- _931636
245	1	0	_aIntroduction to Computer Theory / _cDaniel I.A. Cohen.
250			_a2nd ed.
260			_aNew York ; _aChichester : _bWiley, _cc1997.
300			_axiv, 634 p. : _bill. ; _c27 cm.
504			_aIncludes bibliography (p. 619-620) and index.
505			_aAUTOMATA THEORY. Background. Languages. Recursive Definitions. Regular Expressions. Finite Automata. Transition Graphs. Kleene's Theorem. Finite Automata with Output. Regular Languages. Nonregular Languages. Decidability. PUSHDOWN AUTOMATA THEORY. Context-Free Grammars. Grammatical Format. Pushdown Automata. CFG = PDA. Non-Context-Free Languages. Context-Free Languages. Decidability. TURING THEORY. Turing Machines. Post Machines. Minsky's Theorem. Variations on the TM. TM Languages. The Chomsky Hierarchy. Computers. Bibliography. Indexes.
520			_aThis text strikes a good balance between rigor and an intuitive approach to computer theory. Covers all the topics needed by computer scientists with a sometimes humorous approach that reviewers found refreshing. It is easy to read and the coverage of mathematics is fairly simple so readers do not have to worry about proving theorems.
650		0	_aElectronic digital computers. _91960
942			_2lcc _n0 _cBK
999			_c13634 _d13634