Extremal Infinite Overlap-Free Binary Words
暂无分享,去创建一个
[1] P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .
[2] James D. Currie. On the structure and extendibility of k-power free words , 1995, Eur. J. Comb..
[3] Axel Thue. Selected mathematical papers of Axel Thue , 1977 .
[4] Assaf J. Kfoury,et al. A linear-time algorithm to decide whether a binary word contains an overlap , 1986, Bull. EATCS.
[5] G. A. Hedlund,et al. Unending chess, symbolic dynamics and a problem in semigroups , 1944 .
[6] Robert Shelton. Aperiodic words on three symbols. II. , 1981 .
[7] J. Berstel. Axel Thue''s papers on repetitions in words: a translation. In: Publications du LaCIM, vol. 20. U , 1992 .
[8] Jean-Paul Allouche. Théorie des nombres et automates , 1983 .
[9] Jean Berstel,et al. A Characterization of Overlap-Free Morphisms , 1993, Discret. Appl. Math..
[10] Yuji Kobayashi,et al. Repetition-Free Words , 1986, Theor. Comput. Sci..
[11] Jean Berstel,et al. A Rewriting of Fife's Theorem about Overlap-Free Words , 1994, Results and Trends in Theoretical Computer Science.