Dr. S. R. Lasker Library Online Catalogue

Home      Library Home      Institutional Repository      E-Resources      MyAthens      EWU Home

Amazon cover image
Image from Amazon.com

Introducing the theory of computation / Wayne Goddard.

By: Goddard, WayneMaterial type: TextTextLanguage: English Publication details: New Delhi : Jones and Bartlett Publishers, 2010. Description: xii, 228 p. : ill. ; 24 cmISBN: 9780763741259 (hbk.); 9789380108254Subject(s): Machine theory | Computational complexityDDC classification: 004 LOC classification: QA267 | .G57 2008Online resources: WorldCat details
Contents:
TOC Regular expressions -- Nondeterminism -- Properties of regular languages -- Applications of finite automata -- Context-free grammars -- Pushdown automata -- Grammars and equivalences -- Properties of context-free languages -- Deterministic parsing -- Turing machines -- Variations of Turing machines -- Decidable problems and recursive languages -- Diagonalization and the halting problem -- More undecidable problems -- Recursive functions -- Time complexity -- Space complexity -- NP-completeness / Wayne Goddard.
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 Collection Call number Copy number Status Date due Barcode Item holds
Text Text Dr. S. R. Lasker Library, EWU
Reserve Section 		Non-fiction 004 GOI 2010 (Browse shelf(Opens below)) C-1 Not For Loan 28666
Text Text Dr. S. R. Lasker Library, EWU
Circulation Section 		Non-fiction 004 GOI 2010 (Browse shelf(Opens below)) C-2 Available 28667
Text Text Dr. S. R. Lasker Library, EWU
Circulation Section 		Non-fiction 004 GOI 2010 (Browse shelf(Opens below)) C-3 Available 28668
Text Text Dr. S. R. Lasker Library, EWU
Circulation Section 		Non-fiction 004 GOI 2010 (Browse shelf(Opens below)) C-4 Available 28669
Text Text Dr. S. R. Lasker Library, EWU
Circulation Section 		Non-fiction 004 GOI 2010 (Browse shelf(Opens below)) C-5 Available 28670
Total holds: 0

Includes bibliographical references (p. 201-202) and index.

TOC Regular expressions --
Nondeterminism --
Properties of regular languages --
Applications of finite automata --
Context-free grammars --
Pushdown automata --
Grammars and equivalences --
Properties of context-free languages --
Deterministic parsing --
Turing machines --
Variations of Turing machines --
Decidable problems and recursive languages --
Diagonalization and the halting problem --
More undecidable problems --
Recursive functions --
Time complexity --
Space complexity --
NP-completeness / Wayne Goddard.

CSE

Sagar Shahanawaz

There are no comments on this title.

to post a comment.