Origin-equivalence of two-way word transducers is in PSPACE
From MaRDI portal
Publication:5090958
Recommendations
Cites work
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1059243 (Why is no real title available?)
- scientific article; zbMATH DE number 3254906 (Why is no real title available?)
- A general theory of translation
- A note on the reduction of two-way automata to one-way automata
- A remark on finite transducers
- Context-free graph grammars and concatenation of graphs
- Decision problems of tree transducers with origin
- Expressiveness of streaming string transducers
- Graph structure and monadic second-order logic. A language-theoretic approach
- Logics for word transductions with synthesis
- MSO definable string transductions and two-way finite-state transducers
- Nondeterministic Streaming String Transducers
- On equivalence and uniformisation problems for finite transducers
- On the degree of ambiguity of finite automata
- Regular Transformations of Data Words Through Origin Information
- The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable
- The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
- Transducers with Origin Information
- Which classes of origin graphs are generated by transducers
Cited in
(5)- One-way resynchronizability of word transducers
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
- Resynchronized uniformization and definability problems for rational relations
- On Synthesis of Resynchronizers for Transducers
- scientific article; zbMATH DE number 7559429 (Why is no real title available?)
This page was built for publication: Origin-equivalence of two-way word transducers is in PSPACE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090958)