#### Filter Results:

#### Publication Year

2015

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Juhani Karhumäki, Svetlana Puzynina, Michaël Rao, Markus A. Whiteland
- Theor. Comput. Sci.
- 2017

Two words u and v are k-abelian equivalent if for each word x of length at most k, x occurs equally many times as a factor in both u and v. The notion of k-abelian equivalence is an intermediate notion between the abelian equivalence and the equality of words. In this paper, we study the equivalence classes induced by the k-abelian equivalence, mainly… (More)

Extended abstract It is of interest to somehow measure the complexity of an infinite word. One method is to associate the complexity with the complexity of its finite factors. The factor complexity function, P w : N → N, of an infinite word w ∈ Σ N counts, for each n ∈ N, the number of distinct factors of w of length n. The notion has turned out to be a… (More)

- ‹
- 1
- ›