One-way resynchronizability of word transducers

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

Authors: Sougata Bose, Shankara Narayanan Krishna, Anca Muscholl, 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 software (68Nxx) Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Graph structure and monadic second-order logic. A language-theoretic approach
• Expressiveness of streaming string transducers
• 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
• Factorization forests of finite height
• MSO definable string transductions and two-way finite-state transducers
• Title not available (Why is that?)
• Factorisation Forests for Infinite Words
• On equivalence and uniformisation problems for finite transducers
• Decision problems of tree transducers with origin
• Transducers with Origin Information
• First-order definable string transformations
• Which classes of origin graphs are generated by transducers
• Title not available (Why is that?)
• Aperiodic string transducers
• Title not available (Why is that?)
• Origin-equivalence of two-way word transducers is in PSPACE
• On Synthesis of Resynchronizers for Transducers
• Logical and algebraic characterizations of rational transductions
• From two-way to one-way finite state transducers
• One-way definability of sweeping transducer

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: One-way resynchronizability of word transducers

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