Skip to Main content Skip to Navigation
Conference papers

Uncountable Realtime Probabilistic Classes

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.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-01657007
Contributor : Hal Ifip <>
Submitted on : Wednesday, December 6, 2017 - 11:44:09 AM
Last modification on : Wednesday, December 6, 2017 - 1:46:19 PM

File

440206_1_En_8_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Abuzer Yakaryılmaz, Maksims Dimitrijevs. Uncountable Realtime Probabilistic Classes. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.102-113, ⟨10.1007/978-3-319-60252-3_8⟩. ⟨hal-01657007⟩

Share

Metrics

Record views

88

Files downloads

59