Topics in Symbolic Dynamics and Applications: SEQUENCES OF LOW COMPLEXITY: AUTOMATIC AND STURMIAN SEQUENCES
Topics in Symbolic Dynamics and Applications: SEQUENCES OF LOW COMPLEXITY: AUTOMATIC AND STURMIAN SEQUENCES
复制标题
DOI：
10.1017/cbo9780511758959.002
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
F. Blanchard;Alejandro Maass;Arnaldo Nogueira
中科院分区：
文献类型：
--
作者：
F. Blanchard;Alejandro Maass;Arnaldo Nogueira
复杂度函数是对有限字母表中取值的序列的无序性的一种经典度量：该函数计算给定长度的因子的数量。在此我们介绍复杂度函数较低的两类典型序列：自动序列和斯图姆序列。通过引入一些关于字的组合数学以及符号动力系统研究中的经典工具，我们讨论它们的拓扑性质和测度理论性质。
The complexity function is a classical measure of disorder for sequences with values in a finite alphabet: this function counts the number of factors of given length. We introduce here two characteristic families of sequences of low complexity function: automatic sequences and Sturmian sequences. We discuss their topological and measure-theoretic properties, by introducing some classical tools in combinatorics on words and in the study of symbolic dynamical systems.