Amazon cover image
Image from Amazon.com
Image from Google Jackets
Image from Coce

Theory of computer science: Automata, language and computation

By: Contributor(s): Language: English Publication details: New Delhi : PHI Learning, 2025.Edition: 3rdDescription: xiii, 422p. : ill. ; 24 cmISBN:
  • 9788120329683
Subject(s): Other classification:
  • D65,8(B) R5-;9
Summary: • Expanded sections on pigeonhole principle and the principle of induction (both in Chapter 2) • A rigorous proof of Kleene’s theorem (Chapter 5) • Major changes in the chapter on Turing machines (TMs) – A new section on high-level description of TMs – Techniques for the construction of TMs – Multitape TM and nondeterministic TM • A new chapter (Chapter 10) on decidability and recursively enumerable languages • A new chapter (Chapter 12) on complexity theory and NP-complete problems • A section on quantum computation in Chapter 12.
Item type: Textual
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
Cover image Item type Current library Home library Collection Shelving location Call number Materials specified Vol info URL Copy number Status Notes Date due Barcode Item holds Item hold queue priority Course reserves
Textual Central Science Library Faculty of Technology Library D65,8(B) R5 (Browse shelf(Opens below)) Available FT1793409
Textual Central Science Library Faculty of Technology Library D65,8(B) R5;1 (Browse shelf(Opens below)) Available FT1793410
Textual Central Science Library Faculty of Technology Library D65,8(B) R5;2 (Browse shelf(Opens below)) Available FT1793411
Textual Central Science Library Faculty of Technology Library D65,8(B) R5;3 (Browse shelf(Opens below)) Available FT1793412
Textual Central Science Library Faculty of Technology Library D65,8(B) R5;4 (Browse shelf(Opens below)) Available FT1793413
Textual Central Science Library Faculty of Technology Library D65,8(B) R5;5 (Browse shelf(Opens below)) Available FT1793414
Textual Central Science Library Faculty of Technology Library D65,8(B) R5;6 (Browse shelf(Opens below)) Available FT1793415
Textual Central Science Library Faculty of Technology Library D65,8(B) R5;7 (Browse shelf(Opens below)) Available FT1793416
Textual Central Science Library Faculty of Technology Library D65,8(B) R5;8 (Browse shelf(Opens below)) Available FT1793417
Textual Central Science Library Faculty of Technology Library D65,8(B) R5;9 (Browse shelf(Opens below)) Available FT1793418

Includes Index

• Expanded sections on pigeonhole principle and the principle of induction (both in Chapter 2)
• A rigorous proof of Kleene’s theorem (Chapter 5)
• Major changes in the chapter on Turing machines (TMs) – A new section on high-level description of TMs – Techniques for the construction of TMs – Multitape TM and nondeterministic TM
• A new chapter (Chapter 10) on decidability and recursively enumerable languages
• A new chapter (Chapter 12) on complexity theory and NP-complete problems
• A section on quantum computation in Chapter 12.

There are no comments on this title.

to post a comment.
Previous
Back to results
Next
Close
Copyright @ Delhi University Library System