000			01364 a2200241 4500
999			_c985 _d985
005			20200925120840.0
008			200925b ||||| |||| 00| 0 eng d
020			_a8185015961
040			_bDDC
082			_a629.831 _bHOP
100			_aHopcroft, John E.
245			_aIntroduction to automata theory, languages, and computation
260			_aNew Delhi : _bNarosa Publication, _c1987.
300			_b418 pages : _aill.; _c23 cm.
505			_tFinite automata and regular expressions -- _tProperties of regular sets -- _tContext-free grammars -- _tPushdown automata -- _tProperties of context-free languages -- _tTuring machines -- _tUndecidability -- _tThe Chomsky hierarchy -- _tDeterministic context-free languages -- _tClosure properties of families of languages -- _tComputational complexity theory -- _tIntractable problems -- _tHighlights of other important language classes.
520			_aThis book presents automata theory, formal languages, and computational complexity as a coherent theory. It includes end-of-chapter questions, bibliographies, and exercises. Problems of highest and intermediate difficulty are marked respectively with double or single stars.
650			_aMachine theory
650			_aFormal languages
650			_aComputational complexity
700			_aUllman, Jeffrey D.
942			_cG _2ddc