Add to ORKGAbstract. We consider a general shuffling operation for finite and infinite words which is not necessarily fair. This means that it may be the case that in a shuffle of two words, from some point onwards, one of these words prevails ad infinitum even though the other word still has letters to contribute. Prefixes and limits of shuffles are investigated, leading to a characterization of general shuffles in terms of shuffles of finite words, a result which does not hold for fair shuffles. Associativity of shuffling is an immediate corollary.
There is an increasing interest in the shuffle product on formal languages, mainly because it is a s...
International audienceA word u is a shuffle of words v and w, which we denote by u ∈ v⧢w, if u can b...
. It is shown that for every stationary sequence of random riffle permutations there is a natural a...
AbstractWe consider a general shuffling operation for finite and infinite words which is not necessa...
Summary. We present an overview of different approaches to define shuffles and synchro-nized shuffle...
In this paper we survey some recent researches concerning the shuffle operation that arise both in F...
We consider generative mechanisms producing languages by starting from a finite set of words and shu...
AbstractWe investigate a special variant of the shuffle decomposition problem for regular languages;...
In this paper we introduce and study a new property of infinite words: An infinite word x, with valu...
Abstract. We consider a general shuing operation for ¯nite and in¯nite words which is not necessaril...
peer reviewedIn this paper we introduce and study a new property of infinite words which is invarian...
AbstractWe introduce and study the notion of shuffle residual of a language L: the set containing th...
AbstractThere is an increasing interest in the shuffle product on formal languages, mainly because i...
An intention of MapReduce Sets for Shuffling expressions analysis has to suggest criteria how Shuffl...
Motivated by the general problem to characterize families of languages closed under shuffle, we inve...
There is an increasing interest in the shuffle product on formal languages, mainly because it is a s...
International audienceA word u is a shuffle of words v and w, which we denote by u ∈ v⧢w, if u can b...
. It is shown that for every stationary sequence of random riffle permutations there is a natural a...
AbstractWe consider a general shuffling operation for finite and infinite words which is not necessa...
Summary. We present an overview of different approaches to define shuffles and synchro-nized shuffle...
In this paper we survey some recent researches concerning the shuffle operation that arise both in F...
We consider generative mechanisms producing languages by starting from a finite set of words and shu...
AbstractWe investigate a special variant of the shuffle decomposition problem for regular languages;...
In this paper we introduce and study a new property of infinite words: An infinite word x, with valu...
Abstract. We consider a general shuing operation for ¯nite and in¯nite words which is not necessaril...
peer reviewedIn this paper we introduce and study a new property of infinite words which is invarian...
AbstractWe introduce and study the notion of shuffle residual of a language L: the set containing th...
AbstractThere is an increasing interest in the shuffle product on formal languages, mainly because i...
An intention of MapReduce Sets for Shuffling expressions analysis has to suggest criteria how Shuffl...
Motivated by the general problem to characterize families of languages closed under shuffle, we inve...
There is an increasing interest in the shuffle product on formal languages, mainly because it is a s...
International audienceA word u is a shuffle of words v and w, which we denote by u ∈ v⧢w, if u can b...
. It is shown that for every stationary sequence of random riffle permutations there is a natural a...