Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits

被引：0
|
作者：
Kochergin V.V. [1 ]
Kochergin D.V. [1 ]
机构：
[1] Faculty of Mechanics and Mathematics, Leninskie Gory, Moscow State University, Moscow
来源：
Moscow University Mathematics Bulletin | 2016年 / 71卷 / 2期
关键词：
Asymptotic Behavior; Finite Alphabet; Maximal Complexity; Concatenation Operation; Concatenation Circuit;
D O I：
10.3103/S0027132216020029
中图分类号：
学科分类号：
摘要：
The problem of complexity of word assembly is studied. The complexity of a word means the minimal number of concatenation operations sufficient to obtain this word in the basis of oneletter words over a finite alphabet A (repeated use of obtained words is permitted). Let LA(n) be the maximal complexity of words of length n over a finite alphabet A. In this paper we prove that Шn) = (l + (2 + 0 (1)). © 2016, Allerton Press, Inc.
引用
收藏
页码：55 / 60
页数：5
相关论文
共 34 条
  • [1] THE COMPLEXITY OF WORD CIRCUITS
    Chen, Xue
    Hu, Guangda
    Sun, Xiaoming
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2010, 2 (04) : 482 - 491
  • [2] The Complexity of Word Circuits
    Chen, Xue
    Hu, Guangda
    Sun, Xiaoming
    [J]. COMPUTING AND COMBINATORICS, 2010, 6196 : 308 - +
  • [3] Asymptotic Behavior of Memristive Circuits
    Caravelli, Francesco
    [J]. ENTROPY, 2019, 21 (08)
  • [4] Asymptotic behavior of Markov complexity
    Onn, Shmuel
    Thoma, Apostolos
    Vladoiu, Marius
    [J]. JOURNAL OF PURE AND APPLIED ALGEBRA, 2024, 228 (06)
  • [5] ASYMPTOTIC BEHAVIOR OF WORD METRICS ON COXETER GROUPS
    Noskov, G. A.
    [J]. DOCUMENTA MATHEMATICA, 2011, 16 : 373 - 398
  • [6] ASYMPTOTIC BEHAVIOR AND RATIOS OF COMPLEXITY IN CELLULAR AUTOMATA
    Zenil, Hector
    Villarreal-Zapata, Elena
    [J]. INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS, 2013, 23 (09):
  • [7] The asymptotic behavior of N-adic complexity
    Klapper, Andrew
    [J]. ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2007, 1 (03) : 307 - 319
  • [8] The asymptotic behavior of π-adic complexity with π2=-2
    Klapper, Andrew
    [J]. SEQUENCES, SUBSEQUENCES, AND CONSEQUENCES, 2007, 4893 : 134 - 146
  • [9] On asymptotic gate complexity and depth of reversible circuits without additional memory
    Zakablukov, Dmitry V.
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2017, 84 : 132 - 143
  • [10] The asymptotic behavior of the joint linear complexity profile of multisequences
    Niederreiter, Harald
    Wang, Ping
    [J]. MONATSHEFTE FUR MATHEMATIK, 2007, 150 (02): : 141 - 155
1234