Publication Date:
2014
abstract:
We present an overview of different approaches to define shuffles and synchronized shuffles of words. The shuffle operations considered are distinguished by conditions according to which certain occurrences of symbols common to the original words may or must be identified (synchronized). The words that are shuffled may be infinite which leads to the possibility of unfair shuffling. In addition to illustrating the conceptual differences, we survey and extend known results.
Iris type:
02.01 Contributo in volume (Capitolo o Saggio)
Keywords:
Shuffling; Synchronized shuffling; Infinite words; Fairness; Associativity
List of contributors:
TER BEEK, MAURICE HENRI
Book title:
Discrete Mathematics and Computer Science