RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS
Michael Domaratzki, Kai Salomaa · International Journal of Foundations of Computer Science · 2005
The decidability of the shuffle decomposition problem for regular languages is a long standing open question. We consider decompositions of regular languages with respect to shuffle along a regular set of trajectories and obtain positive decidability results for restricted classes of trajectories. Also we consider decompositions of unary regular languages. Finally, we establish in the spirit of the Dassow-Hinz undecidability result an undecidability result for regular languages shuffled along a fixed linear context-free set of trajectories.