On the Shuffle of Timed Regular languages - Université Paris Cité Accéder directement au contenu
Article Dans Une Revue Bulletin- European Association for Theoretical Computer Science Année : 2006

On the Shuffle of Timed Regular languages

Olivier Finkel
  • Fonction : Auteur
  • PersonId : 834645

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].
Fichier principal
Vignette du fichier
shuffle.pdf (46.77 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-00111151 , version 1 (03-11-2006)

Identifiants

  • HAL Id : hal-00111151 , version 1

Citer

Olivier Finkel. On the Shuffle of Timed Regular languages. Bulletin- European Association for Theoretical Computer Science, 2006, 88, pp.182-184. ⟨hal-00111151⟩
69 Consultations
49 Téléchargements

Partager

Gmail Facebook X LinkedIn More