Computability and Complexity: An Introduction (Second Edition)

Author: Zhang Lialong
Publisher:
Publish Date: 2004-07-01
Features: This book is a textbook and reference for learning computational theory, covering three parts: computability, formal languages and automata, and computational complexity. It primarily introduces several computational models and their equivalences, basic concepts such as the computability of functions, predicates, and languages, formal languages and their corresponding automata models, time and space complexity, NP-completeness, etc. This book can serve as a textbook for undergraduate and graduate students in computer science, a reference for researchers and developers in computer science and technology, and an introductory read for readers interested in computational theory. This book is a textbook and reference for learning the fundamentals of theoretical computer science, covering three parts: computability, formal languages and automata, and computational complexity. It primarily introduces several computational models and their equivalences, basic concepts such as the computability of functions, predicates, and languages, formal languages and their corresponding automata models, time and space complexity, NP-completeness, etc. This book can serve as a textbook for undergraduate and graduate students in computer science, a reference for researchers and developers in computer science and technology, and an introductory textbook for readers interested in theoretical computer science.