A Regular and Complete Notion of Delay for Streaming String Transducers

  title={A Regular and Complete Notion of Delay for Streaming String Transducers},
  author={Emmanuel Filiot and Isma{\"e}l Jecker and Christof L{\"o}ding and Sarah Winter},
The notion of delay between finite transducers is a core element of numerous fundamental results of transducer theory. The goal of this work is to provide a similar notion for more complex abstract machines: we introduce a new notion of delay tailored to measure the similarity between streaming string transducers (SST). We show that our notion is rational : we design a finite automaton that can check whether the delay between two SSTs is smaller than some given bound. As a consequence, our notion… 

Figures from this paper



From Two-Way Transducers to Regular Function Expressions

This paper proposes a direct, simplified and effective translation from unambiguous two-way transducers to regular function expressions extending the Brzozowski and McCluskey algorithm, and derives a subset ofregular function expressions characterizing the (strict) subclass of functional sweeping transducers.

On Equivalence and Uniformisation Problems for Finite Transducers

This paper investigates stronger variants of inclusion, equivalence and sequential uniformisation, based on a general notion of transducer resynchronisation, and shows their decidability.

Regular Transformations of Infinite Strings

This paper defines an equivalent generalization of the machine model of streaming string transducers to infinite strings and shows that type checking and functional equivalence are decidable for MSO-definable transformations of infinite strings.

Degree of Sequentiality of Weighted Automata

This paper considers weighted automata WA with a set semantics, meaning that the semantics is given by the set of weights of accepting runs, and focuses on multi-sequential WA that are defined as finite unions of sequential WA.

On the Decomposition of Finite-Valued Streaming String Transducers

Every 1-register streaming string transducer that associates a uniformly bounded number of outputs with each input can be effectively decomposed as a finite union of functional 1- registers of transducers.

On the Decidability of Bounded Valuedness for Transducers

A new and conceptually different proof is given for the decidability of k-valuedness of transducers (a result due to Gurari and Ibarra), which takes into account the structure of the analysed transducers and yields better complexity bounds.

Nondeterministic Streaming String Transducers

It is shown that NSST are closed under sequential composition and that their expressive power coincides with that of nondeterministic MSO-definable transductions, and that checking if the set of outputs of an NSST is contained within the setof outputs of a finite number of DSSTS is decidable in PSPACE.

Regular combinators for string transformations

An algebraic and machine-independent characterization of this class analogous to the definition of regular languages by regular expressions is given, which proves that every regular function can be constructed from constant functions using the combinators of choice, split sum, and iterated sum, that are analogs of union, concatenation, and Kleene-*, respectively.

Origin-equivalence of two-way word transducers is in PSPACE

It is proved that decidability can be equally recovered by adopting a slightly different, but natural semantics, called origin semantics, and introduced by Bojanczyk in 2014.