Equivalence Relations Defined by Numbers of Occurrences of Factors



: Saarela Aleksi

Publisher: IOS PRESS

: 2016

: Fundamenta Informaticae

: FUNDAMENTA INFORMATICAE

: FUND INFORM

: 145

: 3

: 385

: 397

: 13

: 0169-2968

DOI: https://doi.org/10.3233/FI-2016-1367


We study the question of what can be said about a word based on the numbers of occurrences of certain factors in it. We do this by defining a family of equivalence relations that generalize the so called k-abelian equivalence. The characterizations and answers we obtain are linear algebraic. We also use these equivalence relations to help us in solving some problems related to repetitions and palindromes, and to point out that some previous results about Sturmian words and k-abelian equivalence hold in a more general form.



Last updated on 2024-26-11 at 14:24