Fakta

Publisher	Pearson Education
Language	English
Book type	Hardcover
Utgiven	2000-09-11
Pages	224
ISBN	9780130279613
Kategori(er)

Add to cart

Description

(NOTE: Each chapter concludes with Exercises.)

1. Introduction.

Why Study the Theory of Computing? What Is Computation? The Contents of This Book. Mathematical Preliminaries.

2. Finite Automata.

Deterministic Finite Automata. Nondeterministic Finite Automata. Determinism versus Nondeterminism. Regular Expressions. Nonregular Languages. Algorithms for Finite Automata. The State Minimization Problem.

3. Context Free Languages.

Context-Free Grammars. Parsing. Pushdown Automata. Languages and Automata. Closure Properties. Languages That Are Not Context-Free. Chomsky Normal Form. Determinism.

4. Turing Machines.

Definition of a Turing Machine. Computations by Turing Machines. Extensions of Turing Machines. Nondeterministic Turing Machines. Turing Enumerable Languages.

5. Undecidability.

The Church-Turing Thesis. Universal Turing Machines. The Halting Problem. Undecidable Problems.

6. Computational Complexity.

The Definition and the Class P. The Class N P. N P-Completeness.

References.

List of Symbols.

Index.

So far, we have reused

books.

Sweden's friendliest and environmental friendliest bookshop with the lowest priced textbooks.

This is our ambition, and we do what it takes to get there. We are here to help students to save and earn money on their textbooks while we at the same time save the environment. We were started in 2005 by two students and have since strived to constantly make it easier to buy and sell used textbooks for as many as possible.

Opening Hours