Cover image
Normal view MARC view ISBD view

Introducing the theory of computation /

by Goddard, Wayne (Wayne Dean).
Material type: materialTypeLabelBookPublisher: New Delhi : Jones and Bartlett Publishers, 2010[reprint 2016]Description: xii, 228 p. : ill. ; 24 cm.ISBN: 9780763741259 (hbk.); 9789380108254.Subject(s): Machine theory | Computational complexityOnline resources: WorldCat details
Contents:
Table of contents 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.
    average rating: 0.0 (0 votes)
Item type Location Collection Call number Copy number Status Date due
Text Text Reserve Section Non Fiction 004 GOI 2010 (Browse shelf) C-1 Not For Loan
Text Text Circulation Section Non Fiction 004 GOI 2010 (Browse shelf) C-2 Available
Text Text Circulation Section Non Fiction 004 GOI 2010 (Browse shelf) C-3 Available
Text Text Circulation Section Non Fiction 004 GOI 2010 (Browse shelf) C-4 Available
Text Text Circulation Section Non Fiction 004 GOI 2010 (Browse shelf) C-5 Available

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

Table of contents 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.

Computer Science & Engineering

Sagar Shahanawaz

There are no comments for this item.

Log in to your account to post a comment.

Library Home | Contacts | E-journals

Last Update on 12 January 2014
Copyright @ 2011-2015 EWU Library
East West University