Algorithmic aspects of decomposition and equivalence of finite-valued transducers
From MaRDI portal
(Redirected from Publication:259883)
Recommendations
Cites work
- scientific article; zbMATH DE number 4060732 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- Decomposing a $k$-valued transducer into $k$ unambiguous ones
- Elements of automata theory. Translated from the French by Reuben Thomas
- Lexicographic decomposition of \(k\)-valued transducers
- On the Decidability of Bounded Valuedness for Transducers
- On the Decidability of the Equivalence for k-Valued Transducers
- On the decomposition of \(k\)-valued rational relations
- On the valuedness of finite transducers
- The equivalence of finite valued transducers (on HDT0L languages) is decidable
Cited in
(11)- scientific article; zbMATH DE number 3864474 (Why is no real title available?)
- Lexicographic decomposition of \(k\)-valued transducers
- scientific article; zbMATH DE number 7561615 (Why is no real title available?)
- scientific article; zbMATH DE number 4060732 (Why is no real title available?)
- Implementation and Application of Automata
- Decomposing Finite-Valued Transducers and Deciding Their Equivalence
- A unified framework for disambiguating finite transductions
- scientific article; zbMATH DE number 7561353 (Why is no real title available?)
- On the decidability of the valuedness problem for two-way finite transducers
- scientific article; zbMATH DE number 17828 (Why is no real title available?)
- On equivalence and uniformisation problems for finite transducers
This page was built for publication: Algorithmic aspects of decomposition and equivalence of finite-valued transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259883)
