The second part of this Handbook presents a choice of material on the theory of automata and rewriting systems, the foundations of modern programming languages, logics for program specification and verification, and some chapters on the theoretic modelling of advanced informatio…
"Randomization is an important tool in the design of algorithms, and the ability of randomization to provide enhanced power is a major research topic in complexity theory. Noam Nisan continues the investigation into the power of randomization and the relationships between random…
Computability, Complexity, and Languages.
STACS 84: Symposium of Theoretical Aspects of Computer Scie…
by Association francaise pour la cybernetique economique et technique, Mehlhorn, Kurt, Annual Symposium on Theoretical Aspects of Computer Science, Paris, France), Fontet, M., (Max), Gesellschaft für Informatik
fromLecture Notes in Computer Science
Taking a practical approach, this modern introduction to the theory of computation focuses on the study of problem solving through computation in the presence of realistic resource constraints. The Theory of Computation explores questions and methods that characterize theoretica…