scientific article; zbMATH DE number 7559429

DOI10.4230/LIPIcs.MFCS.2020.58MaRDI QIDQ5089228

Denis Kuperberg, Jan Martens

Publication date: 18 July 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

originundecidabilitytransducersone-waytwo-wayMSOresynchronisation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

One-way resynchronizability of word transducers

Cites Work

• Unnamed Item
• Unnamed Item
• Expressiveness of Streaming String Transducers
• The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
• On equivalence and uniformisation problems for finite transducers
• Origin-equivalence of two-way word transducers is in PSPACE
• On Synthesis of Resynchronizers for Transducers
• Transducers with Origin Information
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
• A variant of a recursively unsolvable problem

This page was built for publication: