Regular functions of infinite words are (partial) functions realized by deterministic two-way transducers with infinite look-ahead. Equivalently, Alur et. al. have shown that they correspond to functions realized by deterministic Muller streaming string transducers, and to functions defined by MSO-transductions.
Feb 13, 2023
Abstract. Regular functions of infinite words are (partial) functions realized by deterministic two-way trans- ducers with infinite look-ahead.
Jul 5, 2023 · Abstract. Regular functions of infinite words are (partial) functions realized by deterministic two-way transducers with infinite look-ahead.
Regular functions of infinite words are (partial) functions realized by deterministic two-way transducers with infinite look-ahead.
Abstract: Regular functions of infinite words are (partial) functions realized by deterministic two-way transducers with infinite look-ahead.
Regular functions of infinite words are (partial) functions realized by deterministic two-way transducers with infinite look-ahead.
May 15, 2019 · For regular functions, we show that computability is equivalent to continuity, and therefore the problem boils down to deciding continuity. We ...
Jun 29, 2022 · Regular functions from infinite words to infinite words can be equivalently specified by MSO-transducers, streaming ω-string transducers as well ...
In this paper, we identify the class of rational functions over infinite words which are also computable by a deterministic two-way transducer. It coincides ...
If A = (Q, A, E) is deterministic, we define a partial function from Q × A into Q by associating with each pair (q, a) in Q × A the unique state q·a (when it ...