Summary. We present an overview of different approaches to define shuffles and synchro-nized 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. “Our conclusion is, in brief, that shuffling is complex.” Ogden, Riddle, and Round in [27], POPL’78
AbstractWe introduce the literal shuffle operation, that is, a more constrained form of the well-kno...
The crux of a card trick performed with a deck of cards usually depends on understanding how shuffle...
AbstractWe investigate a special variant of the shuffle decomposition problem for regular languages;...
Abstract. We consider a general shuffling operation for finite and infinite words which is not neces...
AbstractWe consider a general shuffling operation for finite and infinite words which is not necessa...
In this paper we survey some recent researches concerning the shuffle operation that arise both in F...
In the February 1970 Word Ways, Walter Penney\u27s cryptographic Puzzle 1 asked the reader to determ...
An intention of MapReduce Sets for Shuffling expressions analysis has to suggest criteria how Shuffl...
The mystery of magic and the artistry of juggling have surprising links to interesting ideas in math...
In this paper we introduce and study a new property of infinite words: An infinite word x, with valu...
We consider generative mechanisms producing languages by starting from a finite set of words and shu...
AbstractWe extend the basic shuffle on words and languages, a well-known operation in theoretical co...
The shuffle operation on strings is a fundamental operation, well studied in the theory of formal la...
We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natura...
International audienceA shuffle of two words is formed by interleaving the characters into a new wor...
AbstractWe introduce the literal shuffle operation, that is, a more constrained form of the well-kno...
The crux of a card trick performed with a deck of cards usually depends on understanding how shuffle...
AbstractWe investigate a special variant of the shuffle decomposition problem for regular languages;...
Abstract. We consider a general shuffling operation for finite and infinite words which is not neces...
AbstractWe consider a general shuffling operation for finite and infinite words which is not necessa...
In this paper we survey some recent researches concerning the shuffle operation that arise both in F...
In the February 1970 Word Ways, Walter Penney\u27s cryptographic Puzzle 1 asked the reader to determ...
An intention of MapReduce Sets for Shuffling expressions analysis has to suggest criteria how Shuffl...
The mystery of magic and the artistry of juggling have surprising links to interesting ideas in math...
In this paper we introduce and study a new property of infinite words: An infinite word x, with valu...
We consider generative mechanisms producing languages by starting from a finite set of words and shu...
AbstractWe extend the basic shuffle on words and languages, a well-known operation in theoretical co...
The shuffle operation on strings is a fundamental operation, well studied in the theory of formal la...
We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natura...
International audienceA shuffle of two words is formed by interleaving the characters into a new wor...
AbstractWe introduce the literal shuffle operation, that is, a more constrained form of the well-kno...
The crux of a card trick performed with a deck of cards usually depends on understanding how shuffle...
AbstractWe investigate a special variant of the shuffle decomposition problem for regular languages;...