A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Equivalence Relations Defined by Numbers of Occurrences of Factors
Tekijät: Saarela Aleksi
Kustantaja: IOS PRESS
Julkaisuvuosi: 2016
Journal: Fundamenta Informaticae
Tietokannassa oleva lehden nimi: FUNDAMENTA INFORMATICAE
Lehden akronyymi: FUND INFORM
Vuosikerta: 145
Numero: 3
Aloitussivu: 385
Lopetussivu: 397
Sivujen määrä: 13
ISSN: 0169-2968
DOI: https://doi.org/10.3233/FI-2016-1367
Tiivistelmä
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.
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.
Turun yliopiston Tutkimustietojärjestelmän portaali