On Synthesis of Resynchronizers for Transducers
From MaRDI portal
Recommendations
Cites work
- Decomposing a k-valued transducer into k unambiguous ones
- Expressiveness of streaming string transducers
- Graph structure and monadic second-order logic. A language-theoretic approach
- Multitape one-way nonwriting automata
- On equivalence and uniformisation problems for finite transducers
- On Relations Defined by Generalized Finite Automata
- Origin-equivalence of two-way word transducers is in PSPACE
- Single-valued a-transducers
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- 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
- Unambiguous constrained automata
- Which classes of origin graphs are generated by transducers
Cited in
(5)- One-way resynchronizability of word transducers
- scientific article; zbMATH DE number 7559429 (Why is no real title available?)
- Origin-equivalence of two-way word transducers is in PSPACE
- Simulation by Rounds of Letter-to-Letter Transducers
- Resynchronized uniformization and definability problems for rational relations
This page was built for publication: On Synthesis of Resynchronizers for Transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092432)
