Growth properties of power-free languages

被引:19
|
作者
Shur, Arseny M. [1 ]
机构
[1] Ural Fed Univ, Ekaterinburg, Russia
基金
加拿大自然科学与工程研究理事会;
关键词
Repetition-free language; Power-free language; Combinatorial complexity; Growth rate; Asymptotic properties;
D O I
10.1016/j.cosrev.2012.09.001
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The aim of this paper is to survey the area formed by the intersection of two popular lines of research in formal language theory. The first line, originated by Thue in 1906, concerns repetition-free words and languages. The second line is the study of growth functions for words and languages; it can be traced back to the classical papers by Morse and Hedlund on symbolic dynamics (1938, 1940). Growth functions of repetition-free languages have been investigated since the 1980' s. Most of the results are obtained for power-free languages, but some ideas can be applied for languages avoiding patterns and Abelian-power-free languages as well. In this paper, we present key contributions to the area, its state of the art, and conjectures that suggest answers to some natural unsolved problems. Also, we pay much attention to the tools and techniques that made the progress in the area possible. (C) 2012 Elsevier Inc. All rights reserved.
引用
收藏
页码:187 / 208
页数:22
相关论文
共 50 条