The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable
From MaRDI portal
Cited in
(18)- Register Transducers Are Marble Transducers
- scientific article; zbMATH DE number 7559390 (Why is no real title available?)
- The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index
- On the containment and equivalence problems for two-way transducers
- Normality and two-way automata
- The equivalence of finite valued transducers (on HDT0L languages) is decidable
- Sequences of words defined by two-way transducers
- The equivalence problem for deterministic MSO tree transducers is decidable
- Two-way counter machines and finite-state transducers†
- The many facets of string transducers (invited talk)
- On some transducer equivalence problems for families of languages
- On the decidability of the valuedness problem for two-way finite transducers
- New techniques for proving the decidability of equivalence problem
- Pebble minimization: the last theorems
- Sequentiality of string-to-context transducers
- A survey on decidable equivalence problems for tree transducers
- Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems
- scientific article; zbMATH DE number 7561615 (Why is no real title available?)
This page was built for publication: The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3947121)
