gogo
Amazon cover image
Image from Amazon.com

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

By: Material type: TextTextPublication details: Boston : McGraw-Hill, c2003.Edition: 3rd edDescription: xiii, 543 p. : ill. ; 24 cmISBN:
  • 9780072322002
  • 9780071198547
  • 0072322004 (alk. paper)
Subject(s): DDC classification:
  • 511.3
LOC classification:
  • M29 2003
Online resources:
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.
List(s) this item appears in: CW238 BSc (Hons) Software Development | MSc Data Science
Holdings
Item type Current library Call number Copy number Status Date due Barcode
General Lending Carlow Campus Library General Lending 511.3 (Browse shelf(Opens below)) 1 Available 42688

CW_SRSDS_M

CW082

CW228

CW238

Includes bibliographical references (p. 529-530) and 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.

136.75

Powered by Koha