%0 Conference Proceedings
%T Uncountable Realtime Probabilistic Classes
%+ University of Latvia (LU)
%A Yakaryilmaz, Abuzer
%A Dimitrijevs, Maksims
%Z Part 2: Contributed Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 19th International Conference on Descriptional Complexity of Formal Systems (DCFS)
%C Milano, Italy
%Y Giovanni Pighizzini
%Y Cezar Câmpeanu
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-10316
%P 102-113
%8 2017-07-03
%D 2017
%R 10.1007/978-3-319-60252-3_8
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.2
%2 https://inria.hal.science/hal-01657007/document
%2 https://inria.hal.science/hal-01657007/file/440206_1_En_8_Chapter.pdf
%L hal-01657007
%U https://inria.hal.science/hal-01657007
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-WG1-2
%~ IFIP-LNCS-10316