6 citations · 10 across the 4 of their papers we have counts for
5 papers
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…
Permutation Complexity Related to the Letter Doubling Map
Steven Widmer
Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, π, of X is a linear ordering of X. This paper investigates the combinatorial…
Permutation Complexity and the Letter Doubling Map
Steven Widmer
Given a countable set X (usually taken to be N or Z), an infinite permutation of X is a linear ordering of X. This paper investigates the combinatorial complexity of infi…
Permutation Complexity of the Thue-Morse Word
Steven Widmer
Given a countable set X (usually taken to be the natural numbers or the integers), an infinite permutation πof X is a linear ordering of X. This paper investigates the combinatoria…
Palindromic Richness
Amy Glen, Jacques Justin, Steve Widmer +1
In this paper, we study combinatorial and structural properties of a new class of finite and infinite words that are 'rich' in palindromes in the utmost sense. A characteristic pro…