Register Transducers Are Marble Transducers
From MaRDI portal
Publication:5089194
DOI10.4230/LIPIcs.MFCS.2020.29OpenAlexW3074043254MaRDI QIDQ5089194
Emmanuel Filiot, Paul Gastin, Gaëtan Douéneau-Tabot
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2005.01342
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the degree of ambiguity of finite automata
- Copyful streaming string transducers
- Some definitional suggestions for automata theory
- Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata
- Expressiveness of Streaming String Transducers
- Regular Transformations of Infinite Strings
- On the Decidability of Bounded Valuedness for Transducers
- The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable
- MSO definable string transductions and two-way finite-state transducers
- Aperiodic String Transducers
- On Reversible Transducers
- Pebble Minimization of Polyregular Functions
This page was built for publication: Register Transducers Are Marble Transducers
