Uncountable Realtime Probabilistic Classes

被引：2
|
作者：
Dimitrijevs, Maksims [1 ]
Yakaryilmaz, Abuzer [1 ]
机构：
[1] Univ Latvia, Fac Comp, Raina Bulvaris 19, LV-1586 Riga, Latvia
来源：
DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2017 | 2017年 / 10316卷
关键词：
COMPLEXITY; MACHINES; SPACE;
D O I：
10.1007/978-3-319-60252-3_8
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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.
引用
收藏
页码：102 / 113
页数：12
相关论文
共 50 条
  • [11] UNCOUNTABLE EXISTENTIALLY CLOSED GROUPS IN LOCALLY FINITE-GROUP CLASSES
    LEINEN, F
    GLASGOW MATHEMATICAL JOURNAL, 1990, 32 : 153 - 163
  • [12] On Fraïssé’s Theorem for Uncountable Classes of Finitely Generated Structures
    Kudaĭbergenov K.Z.
    Siberian Advances in Mathematics, 2018, 28 (1) : 60 - 64
  • [13] Probabilistic Realtime Failure Detection for Safety Enforcement Workflows
    Thimm, Heiko
    2016 IEEE 16TH INTERNATIONAL CONFERENCE ON ENVIRONMENT AND ELECTRICAL ENGINEERING (EEEIC), 2016,
  • [14] Probabilistic martingales and BPTIME classes
    Regan, KW
    Sivakumar, D
    THIRTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY - PROCEEDINGS, 1998, : 186 - 200
  • [15] Learning classes of probabilistic automata
    Denis, F
    Esposito, Y
    LEARNING THEORY, PROCEEDINGS, 2004, 3120 : 124 - 139
  • [16] PROBABILISTIC COMPLEXITY CLASSES AND LOWNESS
    SCHONING, U
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1989, 39 (01) : 84 - 100
  • [17] Probabilistic inductive classes of graphs
    Kejzar, Natasar
    Nikoloski, Zoran
    Batagelj, Vladimir
    JOURNAL OF MATHEMATICAL SOCIOLOGY, 2008, 32 (02): : 85 - 109
  • [18] Realtime monitoring of vascular conditions using a probabilistic neural network
    Sakane, A
    Tsuji, T
    Tanaka, Y
    Shiba, K
    Saeki, N
    Kawamoto, M
    ADVANCES IN NEURAL NETWORKS - ISNN 2004, PT 2, 2004, 3174 : 488 - 493
  • [19] On the structure of logspace probabilistic complexity classes
    Macarie, II
    SIAM JOURNAL ON COMPUTING, 2000, 29 (03) : 987 - 1007
  • [20] PROBABILISTIC HIERARCHIES TO AMBIGUOUS CONCEPT CLASSES
    FELDMAN, SE
    JOURNAL OF EXPERIMENTAL PSYCHOLOGY, 1963, 65 (03): : 240 - &
12345