000			01083nam a2200301 a 4500
001			16063936
008			111226s2008 njua b 001 0 eng d
010			_a 2010275411
020			_a9780132288064
020			_a0132288060
040			_aUMC _cUMC _dBAKER _dCUY _dCOD _dDLC _dBD-DhAAL
042			_alccopycat
050	0	0	_aQA267 _b.R53 2008
082	0	4	_a511.3 _222
100	1		_aRich, Elaine.
245	1	0	_aAutomata, computability and complexity : _btheory and applications / _cElaine Rich.
260			_aUpper Saddle River, N.J. : _bPearson Prentice Hall, _cc2008.
300			_axx, 1099 p. : _bill. ; _c25 cm.
504			_aIncludes bibliographical references and index.
505	0		_aFinite state machines and regular languages -- Context-free languages and pushdown automata -- Turing machines and undecidability -- Complexity.
650		0	_aMachine theory.
650		0	_aComputable functions.
650		0	_aComputational complexity.
650		0	_aElectronic data processing.
942	0	0	_02
999			_c11666 _d11666