On the complexity of recurring sequences

被引：0
|
作者：
机构：
来源：
Discrete Mathematics and Applications | 2003年 / 13卷 / 02期
基金：
俄罗斯基础研究基金会;
关键词：
D O I：
10.1163/156939203322109122
中图分类号：
学科分类号：
摘要：
We study recurring sequences over finite fields sets and the set N = {0, 1, 2, . . .}. The complexity of recurring sequences over finite sets is estimated as the complexity of computing on determinate linearly bounded automata. We introduce the notion of a branching recurring sequence. The complexity of branching recurring sequences over finite sets is estimated as the complexity of computing on non-determinate linearly bounded automata. Recurring sequences over the set N simulate computations on multi-tape Minsky machines. We ascertain undecidability of some problems concerning this type of recurring sequences.
引用
收藏
页码：167 / 178
相关论文
共 50 条
  • [41] RECURRING SEQUENCES OVER VECTOR-SPACES
    SINGH, S
    LINEAR ALGEBRA AND ITS APPLICATIONS, 1990, 131 : 93 - 106
  • [42] Finite linear recurring sequences and homogeneous ideals
    Universitat Innsbruck, Innsbruck, Austria
    Appl Algebra Eng Commun Comput, 5 (377-390):
  • [43] Studies on the distribution of the shortest linear recurring sequences
    Yin, Qian
    Yuan, Zhi-Yong
    Guo, Ping
    INFORMATION SCIENCES, 2009, 179 (14) : 2379 - 2389
  • [44] Finite linear recurring sequences and homogeneous ideals
    Althaler, J
    Dur, A
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 1996, 7 (05) : 377 - 390
  • [45] LINEAR RECURRING SEQUENCES OVER NONCOMMUTATIVE RINGS
    Cherchem, Ahmed
    Garici, Tarek
    Necer, Abdelkader
    JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2012, 11 (02)
  • [46] Weak and strong orders of linear recurring sequences
    Zenonas Navickas
    Minvydas Ragulskis
    Dovile Karaliene
    Tadas Telksnys
    Computational and Applied Mathematics, 2018, 37 : 3539 - 3561
  • [47] Multiplicative character sums for nonlinear recurring sequences
    Niederreiter, H
    Winterhof, A
    ACTA ARITHMETICA, 2004, 111 (03) : 299 - 305
  • [48] Weak and strong orders of linear recurring sequences
    Navickas, Zenonas
    Ragulskis, Minvydas
    Karaliene, Dovile
    Telksnys, Tadas
    COMPUTATIONAL & APPLIED MATHEMATICS, 2018, 37 (03): : 3539 - 3561
  • [49] Generalized Joint Linear Complexity of Linear Recurring Multisequences
    Meidl, Wilfried
    Oezbudak, Ferruh
    SEQUENCES AND THEIR APPLICATIONS - SETA 2008, 2008, 5203 : 266 - +
  • [50] Complexity of automatic sequences
    Zantema, Hans
    Bosma, Wieb
    INFORMATION AND COMPUTATION, 2022, 288
12345