Determinization of transducers over infinite words: The general case

DOI10.1007/s00224-003-1014-9zbMath1088.68083OpenAlexW2000287214MaRDI QIDQ1882533

Olivier Carton, Marie-Pierre Béal

Publication date: 1 October 2004

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-00619205/file/hal.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Definability Results for Top-Down Tree Transducers ⋮ Normality and automata ⋮ Unnamed Item

This page was built for publication: Determinization of transducers over infinite words: The general case