One-way definability of sweeping transducer

DOI10.4230/LIPICS.FSTTCS.2015.178MaRDI QIDQ5275366zbMATHOpenAlexFDO

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

zbMATH Keywords

sweeping transducersone-way definabilityregular word transductions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 7003194
• From two-way to one-way finite state transducers
• Untwisting two-way transducers in elementary time
• Input- or output-unary sweeping transducers are weaker than their 2-way counterparts
• Two-way transducers with a two-way output tape

Cited in

(7)

• Untwisting two-way transducers in elementary time
• One-way resynchronizability of word transducers
• From two-way to one-way finite state transducers
• Input- or output-unary sweeping transducers are weaker than their 2-way counterparts
• scientific article; zbMATH DE number 7003194 (Why is no real title available?)
• On the decidability of the valuedness problem for two-way finite transducers
• The many facets of string transducers (invited talk)

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)