On the decidability of the valuedness problem for two-way finite transducers

Recommendations

Characterizing the valuedness of two-way finite transducers
On the valuedness of finite transducers
The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable
On the Decidability of Bounded Valuedness for Transducers
On the Decidability of the Equivalence for k-Valued Transducers
Decomposing Finite-Valued Transducers and Deciding Their Equivalence
On the ambiguity and finite-valuedness problems in acceptors and transducers
The equivalence of finite valued transducers (on HDT0L languages) is decidable
scientific article; zbMATH DE number 4003554
scientific article; zbMATH DE number 4060732

Cites work

A note on finite-valued and finitely ambiguous transducers
Algorithmic aspects of decomposition and equivalence of finite-valued transducers
Decomposing a k-valued transducer into k unambiguous ones
Decomposing Finite-Valued Transducers and Deciding Their Equivalence
From two-way to one-way finite state transducers
scientific article; zbMATH DE number 3664335 (Why is no real title available?)
scientific article; zbMATH DE number 7003194 (Why is no real title available?)
scientific article; zbMATH DE number 7354705 (Why is no real title available?)
scientific article; zbMATH DE number 3254906 (Why is no real title available?)
Lexicographic decomposition of \(k\)-valued transducers
MSO definable string transductions and two-way finite-state transducers
On Relations Defined by Generalized Finite Automata
On the Decidability of Bounded Valuedness for Transducers
On the Decidability of the Equivalence for k-Valued Transducers
On the lengths of values in a finite transducer
On the valuedness of finite transducers
One-way definability of sweeping transducer
Reversal-Bounded Multicounter Machines and Their Decision Problems
Single-valued a-transducers
Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
The complexity of decision problems for finite-turn multicounter machines
The decidability of equivalence for deterministic finite transducers
The equivalence of finite valued transducers (on HDT0L languages) is decidable
The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable
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
Uniformisation of two-way transducers

Cited in

(9)

On the valuedness of finite transducers
Characterizing the valuedness of two-way finite transducers
On the ambiguity, finite-valuedness, and lossiness problems in acceptors and transducers
On the Decidability of Bounded Valuedness for Transducers
scientific article; zbMATH DE number 4003554 (Why is no real title available?)
On the ambiguity and finite-valuedness problems in acceptors and transducers
Decomposing finite-valued two-way finite transducers
Finite-valued streaming string transducers
Finite-valued streaming string transducers

This page was built for publication: On the decidability of the valuedness problem for two-way finite transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2672252)