National Open University Library

Image from Google Jackets

Introduction to languages and the theory of computation /

By: Material type: TextPublication details: Boston : McGraw-Hill, c2003.Edition: 4th edDescription: xii, 436 p. : illISBN:
  • 9780071289429
Subject(s): DDC classification:
  • QA267.5 M37 2011
Contents:
Mathematical Notation and Techniques -- Basic Mathematical Objects -- Mathematical Induction and Recursive Definitions -- Regular Languages and Finite Automata -- Regular Languages and Finie Automata -- Nondeterminism and Kleene's Theorem -- Regular and Nonregular Languages -- Context-Free Languages and Pushdown Automata -- Context-Free Grammars -- Pushdown Automata -- Context-Free and Non-Context-Free Languages -- Turing Machines and Their Languages -- Turing Machines -- Recursively Enumerable Languages -- Unsolvable Problems and Computable Functions -- Unsolvable Problems -- Computable Functions -- Introduction to Computational Complexity -- Measuring and Classifying Complexity -- Tractable and Intractable Problems.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Cover image Item type Current library Home library Collection Shelving location Call number Materials specified Vol info URL Copy number Status Notes Date due Barcode Item holds Item hold queue priority Course reserves
Books Spec. Study Centre Immigration, Gwagwalada, Abuja QA267.55A .M37 2011 (Browse shelf(Opens below)) Available 02013490

Including Indexes

Mathematical Notation and Techniques -- Basic Mathematical Objects -- Mathematical Induction and Recursive Definitions -- Regular Languages and Finite Automata -- Regular Languages and Finie Automata -- Nondeterminism and Kleene's Theorem -- Regular and Nonregular Languages -- Context-Free Languages and Pushdown Automata -- Context-Free Grammars -- Pushdown Automata -- Context-Free and Non-Context-Free Languages -- Turing Machines and Their Languages -- Turing Machines -- Recursively Enumerable Languages -- Unsolvable Problems and Computable Functions -- Unsolvable Problems -- Computable Functions -- Introduction to Computational Complexity -- Measuring and Classifying Complexity -- Tractable and Intractable Problems.

There are no comments on this title.

to post a comment.
Share