000			01165cam a22003137a 4500
001			16063936
005			20131112113614.0
008			100121s2008 njua b 001 0 eng d
010			_a 2010275411
020			_a9788131788226
035			_a(OCoLC)ocn184990945
040			_aUMC _cUMC _dBAKER _dCUY _dCOD _dDLC
042			_alccopycat
050	0	0	_aQA267 _b.R53 2008
082			_a511.3 _bRIC-A
100	1		_aRich, Elaine.
245	1	0	_aAutomata, computability and complexity : _btheory and applications _cElaine Rich.
260			_aNew Delhi : _bPearson, _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.
906			_a7 _bcbc _ccopycat _d2 _encip _f20 _gy-gencatlg
942			_2ddc _cBK
999			_c7307 _d7307