Determinization of transducers over infinite words

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 :
Conference papers
Complete list of metadatas

https://hal-upec-upem.archives-ouvertes.fr/hal-00619850
Contributor : Marie-Pierre Béal <>
Submitted on : Thursday, October 6, 2011 - 1:52:48 PM
Last modification on : Wednesday, April 11, 2018 - 12:12:02 PM
Long-term archiving on: Saturday, January 7, 2012 - 2:21:09 AM

Files

hal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00619850, version 1

Collections

Citation

Marie-Pierre Béal, Olivier Carton. Determinization of transducers over infinite words. 27thInternational Colloquium on Automata, Languages and Programming (ICALP 2000), 2000, Switzerland. pp.561-570. ⟨hal-00619850⟩

Share

Metrics

Record views

214

Files downloads

223