scientific article; zbMATH DE number 4003554

zbMATH Open0618.68069MaRDI QIDQ4728263FDOQ4728263

Authors: Karel II Culik, Juhani Karhumäki 

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

• The equivalence of finite valued transducers (on HDT0L languages) is decidable
• Equivalence of finite-valued tree transducers is decidable
• Decomposing Finite-Valued Transducers and Deciding Their Equivalence
• scientific article
• On the Decidability of the Equivalence for k-Valued Transducers
• The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable
• On the valuedness of finite transducers
• On the decidability of the valuedness problem for two-way finite transducers
• Equivalence of finite-valued symbolic finite transducers
• scientific article; zbMATH DE number 7561615

zbMATH Keywords

test setequivalence problemHDT0L languagefinite transducersmultivalued transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (9)

• Title not available (Why is that?)
• HDTOL matching of computations of multitape automata
• $§igma TC$-порождаемые языки и проблемы относительной эквивалентности
• On some transducer equivalence problems for families of languages
• On the decidability of the valuedness problem for two-way finite transducers
• The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable
• On the Decidability of the Equivalence for k-Valued Transducers
• On the Decidability of Bounded Valuedness for Transducers
• Title not available (Why is that?)

This page was built for publication:

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