On the subword complexity of square-free DOL languages
Tóm tắt
Từ khóa
Tài liệu tham khảo
Berstel, 1979, Sur les mots sans carré définis par un morphisme, 71, 16
Berstel, 1979, Mots sans carré et morphismes iterés, Discrete Math., 29, 235, 10.1016/0012-365X(80)90151-X
Brzozowski, 1971, Classification of noncounting events, J. Comput. System Sci., 5, 41, 10.1016/S0022-0000(71)80006-5
Ehrenfeucht, 1975, Subword complexities of various classes of deterministic developmental languages without interactions, Theoret. Comput. Sci., 1, 59, 10.1016/0304-3975(75)90012-2
Ehrenfeucht, 1979, On the structure of polynomially bounded DOL systems, Fund. Informaticae, 2, 187, 10.3233/FI-1978-2112
Ehrenfeucht, 1980, On subword complexities of homomorphic images of languages
Harrison, 1978
Istrail, 1977, On irreducible languages and nonrational numbers, Bull. Soc. Math. Roumanie, 21, 301
Rozenberg, 1980
A. Salomaa, Morphisms on free monoids and language theory, in: R. Book, Ed., Formal Language Theory: Perspectives and Open Problems (Academic Press, New York) to appear.
Thue, 1906, Über unendliche zeichenreihen, Norske Vid. Selsk. Skr. I Mat.-Nat. Kl., 7, 1
Thue, 1912, Über die gegenseitige lage gleicher teile gewisser zeichenreichen, Norske Vid. Selsk. Skr. I Mat.-Nat. Kl., 1, 1