Introduction to the theory of computation / Michael Sipser.

By: Sipser MichaelMaterial type: Text

TextPublication details: New Delhi. Cengage Learning; 2013. Edition: 3rd ed. 2013Description: vi-458 p. softbound 15x24cmISBN: 978-81-315-2529-6DDC classification: 511.35

Contents:

Introduction. 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. Selected Bibliography.

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

Average rating: 0.0 (0 votes)

Holdings ( 2 )
Title notes ( 1 )
Comments ( 0 )

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode
Books	Tetso College Library Science and Technology	Non-fiction	511.35 SIP (Browse shelf(Opens below))	Available		10547
Books	Tetso College Library Science and Technology	Non-fiction	511.35 SIP (Browse shelf(Opens below))	Available		10552

Introduction.
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.
Selected Bibliography.

There are no comments on this title.

to post a comment.