Synthesis of Computable Regular Functions of Infinite Words

Regular functions from infinite words to infinite words can be equivalently specified by MSO-transducers, streaming $\omega$-string transducers as well as deterministic two-way transducers with look-ahead. In their one-way restriction, the latter transducers define the class of rational functions. E...

Full description

Bibliographic Details
Main Authors: V. Dave, E. Filiot, S. Krishna, N. Lhote
Format: Article
Language:English
Published: Logical Methods in Computer Science e.V. 2022-06-01
Series:Logical Methods in Computer Science
Subjects:
Online Access:https://lmcs.episciences.org/7592/pdf