Uncountable realtime probabilistic classes
Computational Complexity
2017-05-05 v1 Formal Languages and Automata Theory
Abstract
We investigate the minimum cases for realtime probabilistic machines that can define uncountably many languages with bounded error. We show that logarithmic space is enough for realtime PTMs on unary languages. On binary case, we follow the same result for double logarithmic space, which is tight. When replacing the worktape with some limited memories, we can follow uncountable results on unary languages for two counters.
Keywords
Cite
@article{arxiv.1705.01773,
title = {Uncountable realtime probabilistic classes},
author = {Maksims Dimitrijevs and Abuzer Yakaryılmaz},
journal= {arXiv preprint arXiv:1705.01773},
year = {2017}
}
Comments
12 pages. Accepted to DCFS2017