This unique book presents a comprehensive and rigorous treatment of the theory of computability which is introductory yet self-contained. It takes a novel approach by looking at the subject using computation models rather than a limitation orientation. Accompanying software simulations (on the World Wide Web) of almost all computational models are available for use in conjunction with the text, and numerous examples are provided on the Web in a user-friendly format. Its applications to computer science itself include interesting links to programming language theory, compiler design theory, and algorithm design. The software, numerous examples, and solutions make this book ideal for self-study by computer scientists and mathematicians alike.
Sprache
Verlagsort
Zielgruppe
Gewicht
ISBN-13
978-0-19-510983-2 (9780195109832)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Klassifikation
R. Gregory Taylor holds degrees from the University of Michigan, New York University, and Columbia University. He is currently chair of the Department of Computer Science at Jersey City State College.
Preface; Chapter 0 - Mathematical Preliminaries; Part I: Models of Computation; Chapter 1 - Turning Machines; Chapter 2 - Additional Varieties of Turning Machines; Chapter 3 - An Introduction to Recursion Theory; Chapter 4 - Markov Algorithms; Chapter 5 - Register Machines; Chapter 6 - Post Systems (Optional); Chapter 7 - The Vector Machine Model of Parallel Computation (Optional); Chapter 8 - The Bounds of Computability; Part II: A Hierarchy of Automata and Formal Languages; Chapter 9 - Regular Languages and Finite-State Automata; Chapter 10 - Context-Free Languages and Pushdown-Stock Automata; Chapter 11 - Context-Free Languages and Compiler Design Theory (Optional); Chapter 12 - Context-Sensitive Languages and Linear Bounded Automata; Chapter 13 - Generative Grammars an the Chomsky Hierarchy; Epilogue
