000			01210pam a22001814a 4500
020			_a9780071289429
082	0	0	_aQA267.5 M37 2011
100	1		_aMartin, John C.
245	1	0	_aIntroduction to languages and the theory of computation /
250			_a4th ed.
260			_aBoston : _bMcGraw-Hill, _cc2003.
300			_axii, 436 p. : _bill. ;
500			_aIncluding Indexes
505	0		_aMathematical Notation and Techniques -- Basic Mathematical Objects -- Mathematical Induction and Recursive Definitions -- Regular Languages and Finite Automata -- Regular Languages and Finie Automata -- Nondeterminism and Kleene's Theorem -- Regular and Nonregular Languages -- Context-Free Languages and Pushdown Automata -- Context-Free Grammars -- Pushdown Automata -- Context-Free and Non-Context-Free Languages -- Turing Machines and Their Languages -- Turing Machines -- Recursively Enumerable Languages -- Unsolvable Problems and Computable Functions -- Unsolvable Problems -- Computable Functions -- Introduction to Computational Complexity -- Measuring and Classifying Complexity -- Tractable and Intractable Problems.
650		0	_aSequential machine theory.
650		0	_aComputable functions.
942			_cBK
999			_c8297 _d8297