We consider various shuffling and unshuffling operations on languages and words, and examine their closure properties. Although the main goal is to provide some good and novel exercises and examples for undergraduate formal language theory classes, we also provide some new results and mention some open problems.http://bulletin.eatcs.org/index.php/beatcs/article/view/7
AbstractWe prove that every slender context-free language is a union of paired loops, thus confirmin...
Motivated by the studies done by G. Siromoney et al. (1973) and Alexan- dru Mateescu et al. (1998) w...
International audienceA word u is a shuffle of words v and w, which we denote by u ∈ v⧢w, if u can b...
We study decision problems of the form: given a regular or linear context-free language $L$, is ther...
There exist very lucid explanations of the combinatorial origins of rational and algebraic functi...
AbstractIn this paper we show that shuffle languages are contained in one-way-NSPACE(logn) thus in P...
AbstractWe introduce and study the notion of shuffle residual of a language L: the set containing th...
AbstractWe investigate a special variant of the shuffle decomposition problem for regular languages;...
AbstractWe introduce the literal shuffle operation, that is, a more constrained form of the well-kno...
We consider several language-theoretic aspects of unique factorization in formal languages. We repro...
AbstractThere is an increasing interest in the shuffle product on formal languages, mainly because i...
AbstractUsing original arguments about sets of integers satisfying some first-order formula of the P...
Motivated by the general problem to characterize families of languages closed under shuffle, we inve...
An F-system is a computational model that performs a folding operation on words of a given language,...
International audienceA permutation is said to be a square if it can be obtained by shuffling two or...
AbstractWe prove that every slender context-free language is a union of paired loops, thus confirmin...
Motivated by the studies done by G. Siromoney et al. (1973) and Alexan- dru Mateescu et al. (1998) w...
International audienceA word u is a shuffle of words v and w, which we denote by u ∈ v⧢w, if u can b...
We study decision problems of the form: given a regular or linear context-free language $L$, is ther...
There exist very lucid explanations of the combinatorial origins of rational and algebraic functi...
AbstractIn this paper we show that shuffle languages are contained in one-way-NSPACE(logn) thus in P...
AbstractWe introduce and study the notion of shuffle residual of a language L: the set containing th...
AbstractWe investigate a special variant of the shuffle decomposition problem for regular languages;...
AbstractWe introduce the literal shuffle operation, that is, a more constrained form of the well-kno...
We consider several language-theoretic aspects of unique factorization in formal languages. We repro...
AbstractThere is an increasing interest in the shuffle product on formal languages, mainly because i...
AbstractUsing original arguments about sets of integers satisfying some first-order formula of the P...
Motivated by the general problem to characterize families of languages closed under shuffle, we inve...
An F-system is a computational model that performs a folding operation on words of a given language,...
International audienceA permutation is said to be a square if it can be obtained by shuffling two or...
AbstractWe prove that every slender context-free language is a union of paired loops, thus confirmin...
Motivated by the studies done by G. Siromoney et al. (1973) and Alexan- dru Mateescu et al. (1998) w...
International audienceA word u is a shuffle of words v and w, which we denote by u ∈ v⧢w, if u can b...
Add to ORKG