Determinization of transducers over infinite words: the general case - Algorithmics Accéder directement au contenu
Article Dans Une Revue Theory of Computing Systems Année : 2004

Determinization of transducers over infinite words: the general case

Résumé

We study the determinization of transducers over infinite words. We consider transducers with all their states final. We give an effective characterization of sequential functions over infinite words. We also describe an algorithm to determinize transducers over infinite words.
Fichier principal
Vignette du fichier
det2.pdf (238.13 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00162483 , version 1 (13-07-2007)

Identifiants

  • HAL Id : hal-00162483 , version 1

Citer

Marie-Pierre Béal, Olivier Carton. Determinization of transducers over infinite words: the general case. Theory of Computing Systems, 2004, 37 (4), pp.483-502. ⟨hal-00162483⟩
117 Consultations
102 Téléchargements

Partager

Gmail Facebook X LinkedIn More