One-way resynchronizability of word transducers
From MaRDI portal
Publication:2233399
Cites work
- scientific article; zbMATH DE number 5286862 (Why is no real title available?)
- scientific article; zbMATH DE number 7003194 (Why is no real title available?)
- scientific article; zbMATH DE number 7559429 (Why is no real title available?)
- scientific article; zbMATH DE number 3254906 (Why is no real title available?)
- Aperiodic string transducers
- Decision problems of tree transducers with origin
- Expressiveness of streaming string transducers
- Factorisation Forests for Infinite Words
- Factorization forests of finite height
- First-order definable string transformations
- From two-way to one-way finite state transducers
- Graph structure and monadic second-order logic. A language-theoretic approach
- Logical and algebraic characterizations of rational transductions
- MSO definable string transductions and two-way finite-state transducers
- On Synthesis of Resynchronizers for Transducers
- On equivalence and uniformisation problems for finite transducers
- One-way definability of sweeping transducer
- 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
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)
