7 citations · 17 across the 8 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2013★ 7 cited
Infinite Self-Shuffling Words
Émilie Charlier, Teturo Kamae, Svetlana Puzynina +1
In this paper we introduce and study a new property of infinite words: An infinite word , with values in a finite set , is said to be -self-shuffling $(k\g…
math.CO2013★ 6 cited
Abelian maximal pattern complexity of words
Teturo Kamae, Steven Widmer, Luca Q. Zamboni
In this paper we study the maximal pattern complexity of infinite words up to Abelian equivalence. We compute a lower bound for the Abelian maximal pattern complexity of infinite w…
math.CO2009★ 1 cited
Infinite permutations of lowest maximal pattern complexity
S. V. Avgustinovich, A. E. Frid, T. Kamae +1
An infinite permutation is a linear ordering of the set of non-negative integers. Generally, the properties of infinite permutations analogous to those of infinite words show some…