One-way definability of sweeping transducer
From MaRDI portal
Publication:5275366
DOI10.4230/LIPICS.FSTTCS.2015.178zbMATH Open1366.68135OpenAlexW2260725127MaRDI QIDQ5275366FDOQ5275366
Authors: Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis
Publication date: 13 July 2017
Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2015.178
Recommendations
Cited In (7)
- From two-way to one-way finite state transducers
- One-way resynchronizability of word transducers
- The many facets of string transducers (invited talk)
- Input- or output-unary sweeping transducers are weaker than their 2-way counterparts
- On the decidability of the valuedness problem for two-way finite transducers
- Untwisting two-way transducers in elementary time
- Title not available (Why is that?)
This page was built for publication: One-way definability of sweeping transducer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5275366)