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 条
  • [41] Uncountable Matter
    Lezra, Jacques
    OXFORD LITERARY REVIEW, 2017, 39 (01) : 17 - +
  • [42] Probabilistic complexity classes and nonuniform computational models - Preface
    Balcazar, JL
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1996, 30 (02): : 89 - 90
  • [43] Probabilistic type-2 operators and "almost"-classes
    Book, RV
    Vollmer, H
    Wagner, KW
    COMPUTATIONAL COMPLEXITY, 1998, 7 (03) : 265 - 289
  • [44] Recognition of object classes via photometry and probabilistic geometry
    Perona, P
    Burl, M
    Leung, T
    Weber, M
    INVESTIGATIVE OPHTHALMOLOGY & VISUAL SCIENCE, 1999, 40 (04) : S399 - S399
  • [45] Inducing probabilistic syllable classes using multivariate clustering
    Müller, K
    Möbius, B
    Prescher, D
    38TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, PROCEEDINGS OF THE CONFERENCE, 2000, : 225 - 232
  • [46] Probabilistic Type-2 Operators and “Almost”-Classes
    R.V. Book
    H. Vollmer
    K.W. Wagner
    computational complexity, 1998, 7 : 265 - 289
  • [47] On some classes of nonlinear contractions in probabilistic metric spaces
    Mihet, Dorel
    Zaharia, Claudia
    FUZZY SETS AND SYSTEMS, 2016, 300 : 84 - 92
  • [48] COMPUTABILITY OF PROBABILISTIC PARAMETERS FOR SOME CLASSES OF FORMAL LANGUAGES
    BEAUQUIER, J
    THIMONIER, L
    LECTURE NOTES IN COMPUTER SCIENCE, 1984, 176 : 194 - 204
  • [49] SIMULTANEOUS STRONG SEPARATIONS OF PROBABILISTIC AND UNAMBIGUOUS COMPLEXITY CLASSES
    EPPSTEIN, D
    HEMACHANDRA, LA
    TISDALL, J
    YENER, B
    MATHEMATICAL SYSTEMS THEORY, 1992, 25 (01): : 23 - 36
  • [50] A new method for soft probabilistic discrimination of ranked classes
    Pomerantsev, A. L.
    Rodionova, O. Ye.
    MICROCHEMICAL JOURNAL, 2025, 212
12345