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.
Origine : Fichiers produits par l'(les) auteur(s)