scientific article

zbMATH Open0758.68049MaRDI QIDQ4027634FDOQ4027634

Helmut Seidl

Publication date: 21 February 1993

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

zbMATH Keywords

tree automatageneralized sequential machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (10)

• The equivalence problem for letter-to-letter bottom-up tree transducers is solvable
• Title not available (Why is that?)
• Decidability of equivalence for a class of non-deterministic tree transducers
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Single-valuedness of tree transducers is decidable in polynomial time
• On the equivalence problem for letter-to-letter top-down tree transducers
• The equivalence problem for deterministic MSO tree transducers is decidable
• On the lengths of values in a finite transducer
• When is a functional tree transduction deterministic?
• 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 Q4027634)