Complexity of controlled bad sequences over finite sets of Nd

被引：3

作者：

Balasubramanian, A. R. ^{[1
]}

机构：

[1] Tech Univ Munich, Munich, Germany

来源：

PROCEEDINGS OF THE 35TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2020) | 2020年

基金：

欧洲研究理事会;

关键词：

well-quasi orders; controlled bad sequences; majoring and minoring ordering; ORDINAL RECURSIVE COMPLEXITY; BOUNDS;

D O I：

10.1145/3373718.3394753

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We provide upper and lower bounds for the length of controlled bad sequences over the majoring and the minoring orderings of finite sets of Nd . The results are obtained by bounding the length of such sequences by functions from the Cichon hierarchy. This allows us to translate these results to bounds over the fast-growing complexity classes. The obtained bounds are proven to be tight for the majoring ordering, which solves a problem left open by Abriola, Figueira and Senno (Theor. Comp. Sci, Vol. 603). Finally, we use the results on controlled bad sequences to prove upper bounds for the emptiness problem of some classes of automata.

引用

页码：130 / 140

页数：11

共 50 条

[41] CONVERGENCE OF SEQUENCES OF CONVEX-SETS IN FINITE DIMENSIONS
SALINETTI, G
WETS, RJB
SIAM REVIEW, 1979, 21 (01) : 18 - 33
[42] PERFECT STAIRCASE PROFILE OF LINEAR COMPLEXITY FOR FINITE SEQUENCES
MORII, M
KASAHARA, M
INFORMATION PROCESSING LETTERS, 1992, 44 (02) : 85 - 89
[43] STATISTICAL PROPERTIES OF FINITE SEQUENCES WITH HIGH KOLMOGOROV COMPLEXITY
LI, M
VITANYI, PMB
MATHEMATICAL SYSTEMS THEORY, 1994, 27 (04): : 365 - 376
[44] Algorithmic complexity and stochastic properties of finite binary sequences
V'yugin, VV
COMPUTER JOURNAL, 1999, 42 (04): : 294 - 317
[45] STATISTICAL TESTING OF FINITE SEQUENCES BASED ON ALGORITHMIC COMPLEXITY
KRAMOSIL, I
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 218 - 226
[46] Expected values for the rational complexity of finite binary sequences
Tian Tian
Wen-Feng Qi
Designs, Codes and Cryptography, 2010, 55 : 65 - 79
[47] Expected values for the rational complexity of finite binary sequences
Tian, Tian
Qi, Wen-Feng
DESIGNS CODES AND CRYPTOGRAPHY, 2010, 55 (01) : 65 - 79
[48] The complexity of membership problems for circuits over sets of integers
Travers, SD
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2004, PROCEEDINGS, 2004, 3153 : 322 - 333
[49] The complexity of membership problems for circuits over sets of integers
Travers, Stephen
THEORETICAL COMPUTER SCIENCE, 2006, 369 (1-3) : 211 - 229
[50] Complexity of solutions of equations over sets of natural numbers
Jez, Artur
Okhotin, Alexander
STACS 2008: PROCEEDINGS OF THE 25TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 2008, : 373 - +

← 1 2 3 4 5 →