On the Shuffle of Star-Free Languages

Giuseppa Castiglione, Antonio Restivo · Fundamenta Informaticae · 2012

Motivated by the general problem to characterize families of languages closed under shuffle, we investigate some conditions under which the shuffle of two star-free languages is star-free. Some of the special cases here approached give rise to new pr

Read the paper · More papers on PaperTik