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

By: Martin, John C Material type: Text

TextLanguage: English Publication details: Boston : McGraw-Hill, c2003. Edition: 3rd edDescription: xiii, 543 p. : ill. ; 24 cmISBN: 0072322004 (alk. paper); 0071198547 (International ed. : alk. paper); 9780072322002 Subject(s): Sequential machine theory | Computable functionsDDC classification: 004 LOC classification: QA267.5.S4 | M29 2003Online resources: WorldCat details | Ebook Fulltxt

Contents:

TOC 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.

Summary: Summary: Providing an introduction to the theory of computation, this work emphasizes formal languages, automata and abstract models of computation, and computability. It includes an introduction to Read more...

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 6 )
Title notes ( 6 )
Comments ( 0 )

Holdings
Item type	Current library	Collection	Call number	Copy number	Status	Barcode
E-Book	Dr. S. R. Lasker Library, EWU E-book	Non-fiction	004 MAI 2003 (Browse shelf(Opens below))		Not for loan
Text	Dr. S. R. Lasker Library, EWU Reserve Section	Non-fiction	004 MAI 2003 (Browse shelf(Opens below))	C-1	Not For Loan	13280
Text	Dr. S. R. Lasker Library, EWU Circulation Section	Non-fiction	004 MAI 2003 (Browse shelf(Opens below))	C-2	Available	13281
Text	Dr. S. R. Lasker Library, EWU Circulation Section	Non-fiction	004 MAI 2003 (Browse shelf(Opens below))	C-3	Available	13282
Text	Dr. S. R. Lasker Library, EWU Circulation Section	Non-fiction	004 MAI 2003 (Browse shelf(Opens below))	C-4	Available	13283
Text	Dr. S. R. Lasker Library, EWU Circulation Section	Non-fiction	004 MAI 2003 (Browse shelf(Opens below))	C-5	Available	13284

Total holds: 0

Browsing Dr. S. R. Lasker Library, EWU shelves, Shelving location: E-book Close shelf browser (Hides shelf browser)

Previous								Next
Previous	004.678 WIW 2004 Web database applications with PHP and MySQL /	004 FRO 2014 From machine-to-machine to the Internet of things :	004 GRE 1998 Fundamentals of the theory of computation :	004 MAI 2003 Introduction to languages and the theory of computation /	004 MOT 1998 The theory of computation /	004 NOP 2007 Introduction to computers /	004 PAI 2001 Introduction to computing systems :	Next

Online version:
Martin, John C.
Introduction to languages and the theory of computation.
Boston : McGraw-Hill, c2003
(OCoLC)606908837

Includes bibliographical references and indexes.

TOC 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.

Summary:
Providing an introduction to the theory of computation, this work emphasizes formal languages, automata and abstract models of computation, and computability. It includes an introduction to Read more...

CSE

Saifun Momota

There are no comments on this title.

to post a comment.