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 条
  • [21] Decidable and Expressive Classes of Probabilistic Automata
    Chadhal, Rohit
    Sistla, A. Prasad
    Viswanathan, Mahesh
    Ben, Yue
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES (FOSSACS 2015), 2015, 9034 : 200 - 214
  • [22] ON RELATIVIZED EXPONENTIAL AND PROBABILISTIC COMPLEXITY CLASSES
    HELLER, H
    INFORMATION AND CONTROL, 1986, 71 (03): : 231 - 243
  • [23] On the structure of logspace probabilistic complexity classes
    Res. and Advanced Development Group, Metamor Software Solutions, 2851 Clover Street, Pittsford, NY 14534, United States
    SIAM J Comput, 3 (987-1007):
  • [24] PROBABILISTIC SYNTHESIS OF ENUMERABLE CLASSES OF FUNCTIONS
    PODNIEKS, KM
    DOKLADY AKADEMII NAUK SSSR, 1975, 223 (05): : 1071 - 1074
  • [25] Decidable and expressive classes of probabilistic automata
    Ben, Yue
    Chadha, Rohit
    Sistla, A. Prasad
    Viswanathan, Mahesh
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2019, 100 : 70 - 95
  • [26] Realtime human motion reconstruction using probabilistic principal component analysis
    Liu, Huajun, 1600, Binary Information Press (10):
  • [27] Uncountable
    Fornaro, Milton
    HISPAMERICA-REVISTA DE LITERATURA, 2021, 50 (150): : 91 - 101
  • [28] UNCOUNTABLE FIELDS HAVE PROPER UNCOUNTABLE SUBFIELDS
    BUTCHER, RS
    HAMILTON, WL
    MILCETICH, JG
    MATHEMATICS MAGAZINE, 1985, 58 (03) : 171 - 172
  • [29] ON RELATIONSHIPS BETWEEN APPROXIMATE AND PROBABILISTIC COMPLEXITY CLASSES
    LI, X
    LI, GY
    SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY, 1994, 37 (02): : 247 - 256
  • [30] IMMUNITY AND SIMPLICITY IN RELATIVIZATIONS OF PROBABILISTIC COMPLEXITY CLASSES
    BALCAZAR, JL
    RUSSO, DA
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1988, 22 (02): : 227 - 244
12345