000			01957nam a22002297a 4500
005			20250804123547.0
006			a|||||r|||||||||||
008			b ||||| |||| 00| 0 eng d
020			_a0072322004 _qalk. paper
040			_aGR-AtMCL _dGR-AtMCL _beng _eAACR2
100	1		_aMartin, John C. _91087
245	1	0	_aIntroduction to languages and the theory of computation / _cJohn C. Martin.
250			_a3rd ed.
260			_aBoston : _bMcGraw-Hill, _cc2003.
300			_axiii, 543 p. : _bill. ; _c24 cm.
504			_aIncludes bibliographical references (p. 529-530) and indexes.
520			_a Introduction to Languages and the Theory of Computation is an introduction to the theory of computation that emphasizes formal languages, automata and abstract models of computation, and computability; it also includes an introduction to computational complexity and NP-completeness. Through the study of these topics, students encounter profound computational questions and are introduced to topics that will have an ongoing impact in computer science. Once students have seen some of the many diverse technologies contributing to computer science, they can also begin to appreciate the field as a coherent discipline. A distinctive feature of this text is its gentle and gradual introduction of the necessary mathematical tools in the context in which they are used. Martin takes advantage of the clarity and precision of mathematical language but also provides discussion and examples that make the language intelligible to those just learning to read and speak it. The material is designed to be accessible to students who do not have a strong background in discrete mathematics, but it is also appropriate for students who have had some exposure to discrete math but whose skills in this area need to be consolidated and sharpened.
650		0	_aSequential machine theory _99917
650		0	_aComputing _99851
942			_cBK
999			_c9857 _d9857