One-way resynchronizability of word transducers

DOI10.1007/978-3-030-71995-1_7OpenAlexW3140144574MaRDI QIDQ2233399

Anca Muscholl, Shankara Narayanan Krishna, Sougata Bose, Gabriele Puppis

Publication date: 18 October 2021

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

zbMATH Keywords

one-way transducersresynchronizersstring transducers

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factorization forests of finite height
• Decision problems of tree transducers with origin
• Expressiveness of Streaming String Transducers
• First-order definable string transformations
• The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
• MSO definable string transductions and two-way finite-state transducers
• On equivalence and uniformisation problems for finite transducers
• Aperiodic String Transducers
• Origin-equivalence of two-way word transducers is in PSPACE
• On Synthesis of Resynchronizers for Transducers
• Transducers with Origin Information
• From Two-Way to One-Way Finite State Transducers
• One-way Definability of Sweeping Transducer.
• Factorisation Forests for Infinite Words
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines