Rainbow of Computer Science pp 90-101
Local Squares, Periodicity and Finite Automata
We consider the general problem when local regularity implies the global one in the setting where local regularity means the existence of a square of certain length in every position of an infinite word. The square can occur as centered or to the left or to the right from each position. In each case there are three variants of the problem depending on whether the square is that of words, that of abelian words or, as an in between case, that of so called k-abelian words. The above nine variants of the problem are completely solved, and some open problems are addressed in the k-abelian case. Finally, an amazing unavoidability result for 2-abelian squares is obtained.
Unable to display preview. Download preview PDF.
- 1.Adian, S.I., Novikov, P.S.: Infinite periodic groups I, II, III. Izv. Akad. Nauk SSSR. Ser. Mat. 32(1,2,3), 212–244, 251–524, 709–731 (1968)Google Scholar
- 2.Avgustinovich, S., Karhumäki, J., Puzynina, S.: On abelian versions of Critical Factorization Theorem. In: Proceedings of the 13th Mons. Theoretical Computer Science Days (2010)Google Scholar
- 6.Harmaala, E.: Private communicationGoogle Scholar
- 10.Lepistö, A.: On Relations between Local and Global Periodicity. PhD thesis, University of Turku (2002)Google Scholar