1 Matching Results

Results open in a new window/tab.

Permutation Complexity Related to the Letter Doubling Map (open access)

Permutation Complexity Related to the Letter Doubling Map

Article presented at the 8th International Conference Words 2011 in Prague, Czech Republic. This article investigates the combinatorial complexity of infinite permutations on N associated with the image of uniformly recurrent aperiodic binary words under the letter doubling map.
Date: August 17, 2011
Creator: Widmer, Steven
System: The UNT Digital Library