Lane A. Hemaspaandra
Abstract
We survey techniques and results obtained over the past thirty years for space-bounded probabilistic computation. We use a common framework for the study of both finite-state automata and logarithmic-space-bounded Turing machines. In particular, we present recent advances on space-efficient deterministic simulation of probabilistic automata.
Index Terms
- SIGACT News Complexity Theory Column 10
Recommendations
Guest Column: One-Tape Turing Machine Variants and Language Recognition
We present two restricted versions of one-tape Turing machines. Both characterize the class of context-free languages. In the first version, proposed by Hibbard in 1967 and called limited automata, each tape cell can be rewritten only in the first d ...
SIGACT News Complexity Theory Column 120
Hamed Hatami and Pooya Hatami, our guest columnists in this issue, take us to a fascinating tour through communication complexity classes, and their relations to structural properties of Boolean matrices. Thanks a lot to Hamed and Pooya for their ...
SIGACT News Complexity Theory Column 104
My deepest thanks to Sabine Broda, Antonio Machiavelo, Nelma Moreira, and Rogerio Reis for welcoming the year 2020 with their exciting tutorial, \Analytic Combinatorics and Descriptional Complexity of Regular Languages on Average."
Comments