Text

Introduction to the theory of computation

---

PART 1: AUTOMATA AND LANGUAGES.
1. Regular Languages.
2. Context-Free Languages.

PART 2: COMPUTABILITY THEORY.
3. The Church-Turing Thesis.
4. Decidability.
5. Reducibility.
6. Advanced Topics in Computability Theory.

PART 3: COMPLEXITY THEORY.
7. Time Complexity.
8. Space Complexity.
9. Intractability.
10. Advanced Topics in Complexity Theory.

---

Availability

Detail Information

Series Title

--

Call Number

004.0151 SIP i

Publisher

Canada : Cengage Learning., 2013

Collation

xxii, 457 hal.; ilus.; 24cm.

Language

English

ISBN/ISSN

9781133187813

Classification

004.0151

Content Type

-

Media Type

-

Carrier Type

-

Edition

3rd Edition ( International Edition )

Subject(s)

Computer Science
Computational Complexity
Machine theory
Komputer, Matematika

Specific Detail Info

--

Statement of Responsibility

Michael Sipser

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment