On the Shuffle of Timed Regular languages
Résumé
We show that the class of regular timed languages is not closed under shuffle. This gives an answer to a question which was raised by E. Asarin in [Challenges in Timed Languages, From Applied Theory to Basic Theory, Bulletin of the EATCS, Volume 83, p. 106-120, 2004].
Loading...