scientific article; zbMATH DE number 7559429

DOI10.4230/LIPICS.MFCS.2020.58MaRDI QIDQ5089228zbMATH OpenFDO

Authors Denis Kuperberg, Jan Martens

Publication date 18 July 2022

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

zbMATH Keywords

MSOone-wayoriginresynchronisationtransducerstwo-wayundecidability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A variant of a recursively unsolvable problem
• Expressiveness of streaming string transducers
• scientific article; zbMATH DE number 5595162 (Why is no real title available?)
• On equivalence and uniformisation problems for finite transducers
• On Synthesis of Resynchronizers for Transducers
• Origin-equivalence of two-way word transducers is in PSPACE
• The Unsolvability of the Equivalence Problem for \varepsilon -Free NGSM’s with Unary Input (Output) Alphabet and Applications
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
• Transducers with Origin Information
• Which classes of origin graphs are generated by transducers

Cited in

(1)

• One-way resynchronizability of word transducers

This page was built for publication:

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