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 条

[31] Complexity of Equations over Sets of Natural Numbers
Jez, Artur
Okhotin, Alexander
THEORY OF COMPUTING SYSTEMS, 2011, 48 (02) : 319 - 342
[32] Splitting games over finite sets
Frédéric Koessler
Marie Laclau
Jérôme Renault
Tristan Tomala
Mathematical Programming, 2024, 203 : 477 - 498
[33] Splitting games over finite sets
Koessler, Frederic
Laclau, Marie
Renault, Jerome
Tomala, Tristan
MATHEMATICAL PROGRAMMING, 2024, 203 (1-2) : 477 - 498
[34] ON A CLASS OF ALGORITHMS OVER FINITE SETS
ZHURAVLEV, II
DOKLADY AKADEMII NAUK SSSR, 1963, 151 (05): : 1025 - &
[35] ON BOREL FIELDS OVER FINITE SETS
SZEKERES, G
BINET, FE
ANNALS OF MATHEMATICAL STATISTICS, 1957, 28 (02): : 494 - 498
[36] On the Linear Complexity of Legendre Sequences Over Fq
Wang, Qiuyan
Lin, Dongdai
Guang, Xuan
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2014, E97A (07): : 1627 - 1630
[37] On interleaved sequences over finite fields
Jiang, SQ
Dai, ZD
Gong, G
DISCRETE MATHEMATICS, 2002, 252 (1-3) : 161 - 178
[38] ON LINEAR SEQUENCES OVER A FINITE FIELD
DAYKIN, DE
AMERICAN MATHEMATICAL MONTHLY, 1963, 70 (06): : 637 - &
[39] Multi-sequences with almost perfect linear complexity profile and function fields over finite fields
Xing, CP
JOURNAL OF COMPLEXITY, 2000, 16 (04) : 661 - 675
[40] WELL-QUASI-ORDERINGS AND SETS OF FINITE SEQUENCES
LAVER, R
MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1976, 79 (JAN) : 1 - 10

← 1 2 3 4 5 →