000			01528nam a2200229Ia 4500
003			NULRC
005			20250520094847.0
008			250520s9999 xx 000 0 und d
020			_a471137723
040			_cNULRC
050			_aQA 76.5 .C64 1997
100			_aCohen, Daniel I. A. _eauthor
245		0	_aIntroduction to computer theory / _cDaniel I.A. Cohen
250			_aRevised edition.
260			_aNew York : _bWiley, _cc1997
300			_axii, 838 pages : _billustrations ; _c24 cm.
504			_aIncludes bibliographical references and index.
505			_aUTOMATA 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			_aELECTRONIC DITIGAL COMPUTERS
942			_2lcc _cBK
999			_c4595 _d4595