Economy of description for single-valued transducers
Information and Computation
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Finite-State Language Processing
Finite-State Language Processing
Theoretical Computer Science - Latin American theoretical informatics
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
Determinization of Transducers over Infinite Words: The General Case
Theory of Computing Systems
Elements of Automata Theory
On relations defined by generalized finite automata
IBM Journal of Research and Development
| Hi-index | 0.00 |
In this paper, we introduce a notion of a right-sequential function on infinite words. The main result is that any rational function is the composition of a right-sequential function and a left-sequential function. This extends a classical result of Elgot and Mezei on finite words to infinite words. We also show that our class of right-sequential functions includes the normalization of real numbers in some base and the truth value of linear temporal logic. Finally, we apply the decomposition theorem to show that automatic sequences are preserved by rational letter-to-letter functions.