On regularity of languages generated by copying systems
暂无分享,去创建一个
[1] Arto Salomaa. Jewels of formal language theory , 1981 .
[2] Juhani Karhumäki,et al. On cube-free ω-words generated by binary morphisms , 1983, Discret. Appl. Math..
[3] Franz-Josef Brandenburg,et al. Uniformly Growing k-TH Power-Free Homomorphisms , 1988, Theor. Comput. Sci..
[4] Dwight R. Bean,et al. Avoidable patterns in strings of symbols , 1979 .
[5] F. M. Dekking,et al. Combinatorial and statistical properties of sequences generated by substitutions , 1980 .
[6] Maxime Crochemore,et al. Sharp Characterizations of Squarefree Morphisms , 1982, Theor. Comput. Sci..
[7] G. A. Hedlund,et al. Unending chess, symbolic dynamics and a problem in semigroups , 1944 .
[8] Arto Salomaa. Morphisms of free monoids and language theory , 1979 .
[9] Andrzej Ehrenfeucht,et al. On the Subword Complexity of Square-Free D0L Languages , 1981, Theor. Comput. Sci..
[10] Janusz A. Brzozowski,et al. OPEN PROBLEMS ABOUT REGULAR LANGUAGES , 1980 .
[11] Jean Berstel,et al. Sur les mots sans carré définis par un morphisme , 1979, ICALP.