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 条
  • [21] Design sequences with high linear complexity over finite fields using generalized cyclotomy
    Vladimir Edemskiy
    Xiaoni Du
    Cryptography and Communications, 2017, 9 : 683 - 691
  • [22] FINITE LENGTH SEQUENCES WITH LARGE NONLINEAR COMPLEXITY
    Peng, Jiarong
    Zeng, Xiangyong
    Sun, Zhimin
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2018, 12 (01) : 215 - 230
  • [23] Entropy and complexity of finite sequences as fluctuating quantities
    Jiménez-Montaño, MA
    Ebeling, W
    Pohl, T
    Rapp, PE
    BIOSYSTEMS, 2002, 64 (1-3) : 23 - 32
  • [24] On the minimum linear complexity of de Bruijn sequences over non-prime finite fields
    Hines, PA
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 1999, 86 (01) : 127 - 139
  • [25] Constructions of sequences with almost perfect linear complexity profile from curves over finite fields
    Xing, CP
    Niederreiter, H
    Lam, KY
    Ding, CS
    FINITE FIELDS AND THEIR APPLICATIONS, 1999, 5 (03) : 301 - 313
  • [26] Tiling sets and spectral sets over finite fields
    Aten, C.
    Ayachi, B.
    Bau, E.
    FitzPatrick, D.
    Iosevich, A.
    Liu, H.
    Lott, A.
    MacKinnon, I.
    Maimon, S.
    Nan, S.
    Pakianathan, J.
    Petridis, G.
    Mena, C. Rojas
    Sheikh, A.
    Tribone, T.
    Weill, J.
    Yu, C.
    JOURNAL OF FUNCTIONAL ANALYSIS, 2017, 273 (08) : 2547 - 2577
  • [27] Distribution preserving sequences of maps and almost constant sequences on finite sets
    Winkler, R
    MONATSHEFTE FUR MATHEMATIK, 1998, 126 (02): : 161 - 174
  • [28] Distribution preserving sequences of maps and almost constant sequences on finite sets
    Reinhard Winkler
    Monatshefte für Mathematik, 1998, 126 : 161 - 174
  • [29] On the Nonlinear complexity and Lempel-Ziv complexity of finite length sequences
    Limniotis, Konstantinos
    Kolokotronis, Nicholas
    Kalouptsidis, Nicholas
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (11) : 4293 - 4302
  • [30] Complexity of Equations over Sets of Natural Numbers
    Artur Jeż
    Alexander Okhotin
    Theory of Computing Systems, 2011, 48 : 319 - 342
12345