TY  - BOOK
AU  - Martin,John C.
TI  - Introduction to languages and the theory of computation
SN  - 0072322004 (alk. paper)
AV  - QA267.5.S4 M29 2003
U1  - 511.3 21
PY  - 2003///
CY  - Boston
PB  - McGraw-Hill
KW  - Sequential machine theory
KW  - Computable functions
N1  - Includes bibliographical references (p. 529-530) and indexes; Pt. I; Mathematical Notation and Techniques --; Ch. 1; Basic Mathematical Objects --; Ch. 2; Mathematical Induction and Recursive Definitions --; Pt. II; Regular Languages and Finite Automata --; Ch. 3; Regular Expressions and Finite Automata --; Ch. 4; Nondeterminism and Kleene's Theorem --; Ch. 5; Regular and Nonregular Languages --; Pt. III; Context-Free Languages and Pushdown Automata --; Ch. 6; Context-Free Grammars --; Ch. 7; Pushdown Automata --; Ch. 8; Context-Free and Non-Context-Free Languages --; Pt. IV; Turing Machines and Their Languages --; Ch. 9; Turing Machines --; Ch. 10; Recursively Enumerable Languages --; Pt. V; Unsolvable Problems and Computable Functions --; Ch. 11; Unsolvable Problems --; Ch. 12; Computable Functions --; Pt. VI; Introduction to Computational Complexity --; Ch. 13; Measuring and Classifying Complexity --; Ch. 14; Tractable and Intractable Problems
UR  - http://www.loc.gov/catdir/description/mh024/2002070865.html
UR  - http://www.loc.gov/catdir/toc/mh023/2002070865.html
ER  -