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 条
  • [1] PRODUCTS OF LINEAR RECURRING SEQUENCES WITH MAXIMUM COMPLEXITY
    RUEPPEL, RA
    STAFFELBACH, OJ
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1987, 33 (01) : 124 - 131
  • [2] Joint linear complexity of multisequences consisting of linear recurring sequences
    Fang-Wei Fu
    Harald Niederreiter
    Ferruh Özbudak
    Cryptography and Communications, 2009, 1 : 3 - 29
  • [3] Joint linear complexity of multisequences consisting of linear recurring sequences
    Fu, Fang-Wei
    Niederreiter, Harald
    Ozbudak, Ferruh
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2009, 1 (01): : 3 - 29
  • [4] Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences
    Fu, Fang-Wei
    Niederreiter, Harald
    Ozbudak, Ferruh
    FINITE FIELDS AND THEIR APPLICATIONS, 2009, 15 (04) : 475 - 496
  • [5] Linear complexity over Fq and over Fqm for linear recurring sequences
    Meidl, Wilfried
    Ozbudak, Ferruh
    FINITE FIELDS AND THEIR APPLICATIONS, 2009, 15 (01) : 110 - 124
  • [6] Recurring sequences
    Nechaev, AA
    FORMAL POWER SERIES AND ALGEBRAIC COMBINATORICS, 2000, : 54 - 66
  • [7] LINEAR COMPLEXITY AND THE MINIMAL POLYNOMIAL OF LINEAR RECURRING SEQUENCES OVER Z/(m)
    戴宗铎
    黄民强
    Systems Science and Mathematical Sciences, 1991, (01) : 51 - 54
  • [8] LINEAR RECURRING SEQUENCES
    ZIERLER, N
    JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1959, 7 (01): : 31 - 48
  • [9] How to determine linear complexity and k-error linear complexity in some classes of linear recurring sequences
    Meidl, Wilfried
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2009, 1 (01): : 117 - 133
  • [10] EXPONENTIAL RECURRING SEQUENCES
    KLOVE, T
    MATHEMATICA SCANDINAVICA, 1974, 34 (01) : 44 - 50
12345