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 条
12345