6533b852fe1ef96bd12aabd6
RESEARCH PRODUCT
Uncountable realtime probabilistic classes
Maksims DimitrijevsAbuzer Yakaryılmazsubject
FOS: Computer and information sciencesComputer Science - Computational ComplexityFormal Languages and Automata Theory (cs.FL)Computer Science - Formal Languages and Automata TheoryComputerApplications_COMPUTERSINOTHERSYSTEMSComputational Complexity (cs.CC)description
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2017-05-04 |