McGraw-Hill OnlineMcGraw-Hill Higher EducationLearning Center
Instructor Center | Information Center | Home
PageOut
Feedback
Help Center


Introduction to Languages and the Theory of Computation, 3/e
John Martin, North Dakota State University

Instructor Center

Contents:

Chapter 1: Basic Mathematical Objects
Chapter 2: Mathematical Induction and Recursive Definitions
Chapter 3: Regular Expressions and Finite Automata
Chapter 4: Nondeterminism and Kleene's Theorem
Chapter 5: Regular and Nonregular Languages
Chapter 6: Content-Free Grammars
Chapter 7: Pushdown Automata
Chapter 8: Context-Free and Non-Context-Free Languages
Chapter 9: Turing Machines
Chapter 10: Recursively Enumerable Languages
Chapter 11: Unsolvable Problems
Chapter 12: Computable Functions
Chapter 13: Measuring and Classifying Complexity
Chapter 14: Tractable and Intractable Problems