ON INFINITE WORDS OBTAINED BY ITERATING MORPHISMS

被引：22

作者：

CULIK, K ^{[1
]}

SALOMAA, A ^{[1
]}

机构：

[1] UNIV TURKU,DEPT MATH,SF-20500 TURKU 50,FINLAND

来源：

THEORETICAL COMPUTER SCIENCE | 1982年 / 19卷 / 01期

关键词：

D O I：

10.1016/0304-3975(82)90013-5

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：29 / 38

页数：10

共 50 条

[1] A generator of morphisms for infinite words
Ochem, Pascal
[J]. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2006, 40 (03): : 427 - 441
[2] On morphisms preserving infinite Lyndon words
Université de Picardie Jules Verne, LaRIA, 33 Rue Saint Leu, 80039 Amiens cedex 1, France
[J]. Discrete Math. Theor. Comput. Sci., 2007, 2 (89-108):
[3] INFINITE FIBONACCI WORDS AND ITERATED MORPHISMS
PANSIOT, JJ
[J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1983, 17 (02): : 131 - 135
[4] Separators in infinite words generated by morphisms
Garel, E
[J]. THEORETICAL COMPUTER SCIENCE, 1997, 180 (1-2) : 81 - 113
[5] On morphisms preserving infinite Lyndon words
Richmme, Gwenaeel
[J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2007, 9 (02): : 89 - 107
[6] INFINITE WORDS AND NON-REPETITIVE MORPHISMS
MARTINS, WT
[J]. ANAIS DA ACADEMIA BRASILEIRA DE CIENCIAS, 1980, 52 (02): : 431 - 432
[7] The equality problem for infinite words generated by primitive morphisms
Honkala, Juha
[J]. INFORMATION AND COMPUTATION, 2009, 207 (08) : 900 - 907
[8] COMPLEXITY OF THE INFINITE WORD FACTORS OBTAINED BY ITERATED MORPHISMS
PANSIOT, JJ
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1984, 172 : 380 - 389
[9] MORPHISMS WHICH GENERATE INFINITE WORDS HAVING PRESCRIBED FACTORS
SEEBOLD, P
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1982, 145 : 301 - 311
[10] Languages obtained from infinite words
Harju, T
Ilie, L
[J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1997, 31 (05): : 445 - 455

← 1 2 3 4 5 →