PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Ter Beek M. H., Kleijn J. Shuffles and synchronized shuffles: a survey. Gheorghe Paun, Grzegorz Rozenberg, and Arto Salomaa (eds.). Bucuresti, Romania: The Publishing House of the Romanian Academy, 2014.
 
 
Abstract
(English)
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.
Subject Shuffling
Synchronized shuffling
Infinite words
Fairness
Associativity
Trajectories
F.4.3 Formal Languages. Operations on languages


Icona documento 1) Download Document PDF
Icona documento 2) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional