Determinization of transducers over infinite words: the general case

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00162483
Contributor : Olivier Carton <>
Submitted on : Friday, July 13, 2007 - 3:34:18 PM
Last modification on : Friday, January 4, 2019 - 5:32:57 PM
Long-term archiving on: Thursday, April 8, 2010 - 11:11:43 PM

File

det2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00162483, version 1

Citation

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

Share

Metrics

Record views

291

Files downloads

190