Determinization of Transducers over Infinite Words

Authors:
Marie-Pierre Béal;Olivier Carton
Affiliations:
-;-
Venue:
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Year:
2000

Citing 7
Cited 1

Two decidability problems for infinite words

Information Processing Letters
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
Finite-State Language Processing

Finite-State Language Processing
Instance-Wise Reaching Definition Analysis for Recursive Programs using Context-Free Transductions

PACT '98 Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques
On some applications of finite-state automata theory to natural language processing

Natural Language Engineering
On the complexity of omega -automata

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science

On the accepting power of 2-tape büchi automata

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.