Introduction to Languages and the Theory of Computation
Martin, John C.
Introduction to Languages and the Theory of Computation - 2nd ed - New Delhi Tata McGraw-Hill Publishing Company Ltd. 2000 - 450p
Part - 1: Mathematical Notation and Techniques Basic Mathematical Objects Mathematical Induction and Recursive Definitions Part - 2: Regular Languages and Finite Automata Regular Expressions and Finite Automata Nondeterminism and Kleene's Theorem Regular and Nonregular Languages Part - 3: Context Free Languages and Pushdown Automata Context Free Grammars Pushdown Automata Context Free and Noncontext Free Languages Part -4: Turing Machines and Their Languages Turing Machines Recursively Enumerable and Recursive Languages Other Grammars Part - 4: Unsolvable Problems and Computable Functions Unsolvable Problems Computable Functions Part - 5: Introduction to Computational Complexity Measuring and Classifying Complexity Tractable and Intractable Problems References Bibliography Index to Notation Index
9780074637227 0.00
Mathematics
511.3 / MAR
Introduction to Languages and the Theory of Computation - 2nd ed - New Delhi Tata McGraw-Hill Publishing Company Ltd. 2000 - 450p
Part - 1: Mathematical Notation and Techniques Basic Mathematical Objects Mathematical Induction and Recursive Definitions Part - 2: Regular Languages and Finite Automata Regular Expressions and Finite Automata Nondeterminism and Kleene's Theorem Regular and Nonregular Languages Part - 3: Context Free Languages and Pushdown Automata Context Free Grammars Pushdown Automata Context Free and Noncontext Free Languages Part -4: Turing Machines and Their Languages Turing Machines Recursively Enumerable and Recursive Languages Other Grammars Part - 4: Unsolvable Problems and Computable Functions Unsolvable Problems Computable Functions Part - 5: Introduction to Computational Complexity Measuring and Classifying Complexity Tractable and Intractable Problems References Bibliography Index to Notation Index
9780074637227 0.00
Mathematics
511.3 / MAR