000			01175nam a22002537a 4500
999			_c28356 _d28356
003			CUTN
005			20190411144040.0
008			190411b ||||| |||| 00| 0 eng d
020			_a9788131788226
041			_aEnglish
082			_a511.3 _bRIC
100			_aRich, Elaine
245			_aAutomata, computability and complexity : _btheory and applications _cElaine Rich
260			_aNoida : _bPearson Education, _c2012.
300			_axx, 1099 pages : _billustrations ; _c25 cm
505			_tFinite state machines and regular languages -- _tContext-free languages and pushdown automata -- _tTuring machines and undecidability -- _tComplexity.
520			_aCombining classic theory with unique applications, this crisp narrative is supported by abundant examples and clarifies key concepts by introducing important uses of techniques in real systems. Broad-ranging coverage allows instructors to easily customize course material to fit their unique requirements.
650			_aMachine theory
650			_aComputable functions
650			_aComputational complexity
650			_aElectronic data processing
650			_aFormal languages
942			_2ddc _cBOOKS