Shuffle on trajectories: syntactic constraints
Theoretical Computer Science
Mappings of languages by two-tape devices
Journal of the ACM (JACM)
Shuffle and scattered deletion closure of languages
Theoretical Computer Science
Theoretical Computer Science
Shuffle factorization is unique
Theoretical Computer Science
Tight lower bound for the state complexity of shuffle of regular languages
Journal of Automata, Languages and Combinatorics
Shuffle-like Operations on omega-words
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Algebraic Theory of Automata & Languages
Algebraic Theory of Automata & Languages
Introduction to Automata Theory, Languages, and Computation
Introduction to Automata Theory, Languages, and Computation
On the uniqueness of shuffle on words and finite languages
Theoretical Computer Science
Recognizing shuffled languages
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Transformations Between Different Models of Unranked Bottom-Up Tree Automata
Fundamenta Informaticae
| Hi-index | 5.23 |
We introduce the mix operation for hedges and the shuffle operation for unranked trees. We show that the shuffle of recognizable tree languages is also a recognizable tree language.