Suppose is a morphism and . For every nonnegative integer , let be the longest common prefix of and , and let be words such that and . We prove that there is a positive integer such that for any positive integer , the prefixes of (resp. ) of length form an ultimately periodic sequence having period . Further, there is a value of which works for all words .
@article{ITA_2007__41_2_215_0, author = {Honkala, Juha}, title = {A periodicity property of iterated morphisms}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, volume = {41}, year = {2007}, pages = {215-223}, doi = {10.1051/ita:2007016}, mrnumber = {2350645}, zbl = {pre05235509}, language = {en}, url = {http://dml.mathdoc.fr/item/ITA_2007__41_2_215_0} }
Honkala, Juha. A periodicity property of iterated morphisms. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 41 (2007) pp. 215-223. doi : 10.1051/ita:2007016. http://gdmltest.u-ga.fr/item/ITA_2007__41_2_215_0/
[1] Elementary homomorphisms and a solution of the D0L sequence equivalence problem. Theoret. Comput. Sci. 7 (1978) 169-183. | Zbl 0407.68085
and ,[2] Subword complexities of various classes of deterministic developmental languages without interactions. Theoret. Comput. Sci. 1 (1975) 59-75. | Zbl 0316.68043
, and ,[3] Developmental Systems and Languages. North-Holland, Amsterdam (1975). | MR 495247 | Zbl 0306.68045
and ,[4] The equivalence problem for DF0L languages and power series. J. Comput. Syst. Sci. 65 (2002) 377-392. | Zbl 1059.68062
,[5] The Mathematical Theory of L Systems. Academic Press, New York (1980). | MR 561711 | Zbl 0508.68031
and ,[6] Handbook of Formal Languages. Vol. 1-3, Springer, Berlin (1997). | Zbl 0866.68057
and (Eds.),[7] Jewels of Formal Language Theory. Computer Science Press, Rockville, Md. (1981). | MR 618124 | Zbl 0487.68064
,