Register Transducers Are Marble Transducers

DOI10.4230/LIPICS.MFCS.2020.29MaRDI QIDQ5089194zbMATH OpenOpenAlexFDO

Authors Gaëtan Douéneau-Tabot, Emmanuel Filiot, Paul Gastin

Publication date 18 July 2022

Full work available at URL https://arxiv.org/abs/2005.01342

zbMATH Keywords

marblespebblesstreaming string transducertwo-way transducer

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Aperiodic string transducers
• Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata
• Copyful streaming string transducers
• Expressiveness of streaming string transducers
• scientific article; zbMATH DE number 3566194 (Why is no real title available?)
• scientific article; zbMATH DE number 1354852 (Why is no real title available?)
• scientific article; zbMATH DE number 7561720 (Why is no real title available?)
• scientific article; zbMATH DE number 3254906 (Why is no real title available?)
• MSO definable string transductions and two-way finite-state transducers
• On reversible transducers
• On the Decidability of Bounded Valuedness for Transducers
• On the degree of ambiguity of finite automata
• Pebble Minimization of Polyregular Functions
• Regular transformations of infinite strings
• Some definitional suggestions for automata theory
• The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable

Cited in

(4)

• Pebble minimization: the last theorems
• Transducers of polynomial growth
• Comparison-free polyregular functions
• Lexicographic transductions of finite words

This page was built for publication: Register Transducers Are Marble Transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089194)