Local squares, periodicity and finite automata

18Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Huova, M., Karhumäki, J., Saarela, A., & Saari, K. (2011). Local squares, periodicity and finite automata. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6570, 90–101. https://doi.org/10.1007/978-3-642-19391-0_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free