PRAGYAAN

Introduction to languages and the theory of computation / John C. Martin.

By: Material type: TextTextPublication details: New Delhi ; Tata McGraw-Hill Education Pvt Ltd ; c2003.Edition: 3rd Edition, Special Indian EditionDescription: xiii, 543 p. : ill. ; 24 cmISBN:
  • 9780070660489
Subject(s): DDC classification:
  • 511.3/5MAR 22
LOC classification:
  • QA267.5.S4 M29 2011
Online resources:
Contents:
Contents : PART 1: MATHEMATICAL NOTATION AND TECHNIQUES Chapter 1: Basic Mathematical Objects Chapter 2: Mathematical Induction and Recursive Definitions PART II: REGULAR LANGUAGES AND FINITE AUTOMATA Chapter 3: Regular Expressions and Finite Automata Chapter 4: Nondeterminism and Kleene's Theorem Chapter 5: Regular and Nonregular Languages PART III: CONTEXT- FREE LANGUAGES AND PUSHDOWN AUTOMATA Chapter 6: Context-Free Grammars Chapter 7: Pushdown Automata Chapter 8: Context-Free and Non-Context- Free Languages PART IV: TURING MACHINES AND THEIR LANGUAGES Chapter 9: Turning Machines Chapter 10: Recursively Enumerable Languages PART V: UNSOLVABLE PROBLEMS AND COMPUTABLE FUNCTIONS Chapter 11: Unsolved Problems Chapter 12: Computable Functions PART VI: INTRODUCTION AND CLASSIFYING COMPLEXITY Chapter 13: Measuring and Classifying Complexity Chapter 14: Tractable and Intractable Problems References Bibliography Index of Notation Index
Summary: Summary : "Introduction to Languages and the Theory of Computation is a highly popular text which provides an introduction to the theory of computation emphasizing on formal languages, automata and abstract models of computation, and computability; it also includes an introduction to computational complexity and NP-completeness.
Tags from this library: No tags from this library for this title.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Date due Barcode
Books IITHLIBRARY Available

Includes bibliographical references (p. 425-426) and index.

Contents : PART 1: MATHEMATICAL NOTATION AND TECHNIQUES Chapter 1: Basic Mathematical Objects Chapter 2: Mathematical Induction and Recursive Definitions PART II: REGULAR LANGUAGES AND FINITE AUTOMATA Chapter 3: Regular Expressions and Finite Automata Chapter 4: Nondeterminism and Kleene's Theorem Chapter 5: Regular and Nonregular Languages PART III: CONTEXT- FREE LANGUAGES AND PUSHDOWN AUTOMATA Chapter 6: Context-Free Grammars Chapter 7: Pushdown Automata Chapter 8: Context-Free and Non-Context- Free Languages PART IV: TURING MACHINES AND THEIR LANGUAGES Chapter 9: Turning Machines Chapter 10: Recursively Enumerable Languages PART V: UNSOLVABLE PROBLEMS AND COMPUTABLE FUNCTIONS Chapter 11: Unsolved Problems Chapter 12: Computable Functions PART VI: INTRODUCTION AND CLASSIFYING COMPLEXITY Chapter 13: Measuring and Classifying Complexity Chapter 14: Tractable and Intractable Problems References Bibliography Index of Notation Index

Summary : "Introduction to Languages and the Theory of Computation is a highly popular text which provides an introduction to the theory of computation emphasizing on formal languages, automata and abstract models of computation, and computability; it also includes an introduction to computational complexity and NP-completeness.

There are no comments on this title.

to post a comment.

Home | IITHLibrary |RAIITH |Catalog
A service provided by IITHLibrary
© Copyright 2022-2023. IITHLibrary, IIT Hyderabad
web page visitor counter