本书涵盖了有穷自动机、正则表达式与语言、正则语言性质、上下文无关文法及上下文无关语言、下推自动机、上下文无关语言的性质、图灵机、不可判定性以及难解问题等内容。
Cognition and Intractability is the first book to provide an accessible introduction to computational complexity analysis and its application to questions of intractability in cognitive science.
Consider the toy shown in Fig. 1.222. A marble is dropped at A or B. Levers x1,x2,x3 cause the marble to fall either to the left or to the right. Whenever a marble encounters a lever, it causes the lever to reverse after the marble ...
Looking at a sequence of zeros and ones, we often feel that it is not random, that is, it is not plausible as an outcome of fair coin tossing. Why?...
An introduction to a rapidly developing topic: the theory of quantum computing. Following the basics of classical theory of computation, the book provides an exposition of quantum computation theory.
"Intended as an upper-level undergraduate or introductory graduate text in computer science theory," this book lucidly covers the key concepts and theorems of the theory of computation.
Proceedings The 2008 International Conference on Computational Science and Its Applications: ICCSA 2008
A clear, concise introduction to the quickly growing field of complexity science that explains its conceptual and mathematical foundations What is a complex system?
The book provides a self-contained introduction to mathematical logic and computability theory for students of mathematics or computer science.