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 条

[31] Probabilistic Cluster Signature for Modeling Motion Classes
Wu, Shandong
Li, Y. F.
Zhang, Jianwei
2009 IEEE-RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, 2009, : 5731 - +
[32] IMMUNITY, SIMPLICITY, PROBABILISTIC COMPLEXITY CLASSES AND RELATIVIZATIONS
LI, HZ
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1988, 26 (01) : 1 - 10
[33] Resource-bounded measure on probabilistic classes
Moser, Philippe
INFORMATION PROCESSING LETTERS, 2008, 106 (06) : 241 - 245
[34] GENERALIZED LOWNESS AND HIGHNESS AND PROBABILISTIC COMPLEXITY CLASSES
KLAPPER, A
MATHEMATICAL SYSTEMS THEORY, 1989, 22 (01): : 37 - 45
[35] On relationships between approximate and probabilistic complexity classes
Li, Xiang
Li, Guang-Yuan
Science in China Series A: Mathematics, Physics, Astronomy and Technological Sciences, 1994, 37 (02):
[36] Derandomization of Probabilistic Auxiliary Pushdown Automata Classes
Venkateswaran, H.
CCC 2006: TWENTY-FIRST ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2006, : 355 - 369
[37] On Relationships Between Approximate and Probabilistic Complexity Classes
李祥
李广元
Science China Mathematics, 1994, (02) : 247 - 256
[38] PROBABILISTIC QUANTIFIERS, ADVERSARIES, AND COMPLEXITY CLASSES - AN OVERVIEW
ZACHOS, S
LECTURE NOTES IN COMPUTER SCIENCE, 1986, 223 : 383 - 400
[39] Capture of homotopy classes with probabilistic road map
Schmitzberger, E
Bouchet, JL
Dufaut, M
Wolf, D
Husson, P
2002 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, VOLS 1-3, PROCEEDINGS, 2002, : 2317 - 2322
[40] From uncountable abelian groups to uncountable nonabelian groups
Eda, Katsuya
RENDICONTI DEL SEMINARIO MATEMATICO DELLA UNIVERSITA DI PADOVA, 2020, 144 : 105 - 114

← 1 2 3 4 5 →