1 research outputs found
FO-definable transformations of infinite strings
The theory of regular and aperiodic transformations of finite strings has
recently received a lot of interest. These classes can be equivalently defined
using logic (Monadic second-order logic and first-order logic), two-way
machines (regular two-way and aperiodic two-way transducers), and one-way
register machines (regular streaming string and aperiodic streaming string
transducers). These classes are known to be closed under operations such as
sequential composition and regular (star-free) choice; and problems such as
functional equivalence and type checking, are decidable for these classes. On
the other hand, for infinite strings these results are only known for
-regular transformations: Alur, Filiot, and Trivedi studied
transformations of infinite strings and introduced an extension of streaming
string transducers over -strings and showed that they capture monadic
second-order definable transformations for infinite strings. In this paper we
extend their work to recover connection for infinite strings among first-order
logic definable transformations, aperiodic two-way transducers, and aperiodic
streaming string transducers