National Open University Library

Image from Google Jackets

Introduction to Languages and the Theory of Computation /

By: Martin, John CMaterial type: TextTextPublication details: Boston : McGraw-Hill, c2003. Edition: 4th edDescription: xii, 436 p. : illISBN: 9780071289429Subject(s): Sequential machine theory | Computable functionsDDC 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
Item type Current library Call number Status Date due Barcode
Books Books Kaduna Study Centre
QA267.5 .M37 2011 (Browse shelf(Opens below)) Available 0175025

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.

Powered by Koha

//