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.
Cite
CITATION STYLE
APA
Bèal, M. P., & Carton, O. (2000). Determinization of transducers over infinite words. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1853, pp. 561–570). Springer Verlag. https://doi.org/10.1007/3-540-45022-x_47
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free