scientific article; zbMATH DE number 3894494

zbMATH Open0561.68056MaRDI QIDQ5186756FDOQ5186756

Authors: L. P. Lisovik 

Publication date: 1984

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

Recommendations

• Equivalence problems for tree transducers: a brief survey
• A survey on decidable equivalence problems for tree transducers
• On the equivalence problem for letter-to-letter top-down tree transducers
• Equivalence of finite-valued tree transducers is decidable
• On equivalence and uniformisation problems for finite transducers
• Equivalence of symbolic tree transducers
• Decidability of equivalence for a class of non-deterministic tree transducers
• The equivalence problem for letter-to-letter bottom-up tree transducers is solvable
• Solvable problems for transformers with reversal-bounded counters
• On the equivalence problem for deterministic multitape automata and transducers

zbMATH Keywords

program schematabounded transformersdecidability of the equivalence problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Semigroups in automata theory, linguistics, etc. (20M35)

Cited In (10)

• The equivalence problem for letter-to-letter bottom-up tree transducers is solvable
• Approximate consistency for transformations on words and trees
• On the equivalence problem for letter-to-letter top-down tree transducers
• Deterministic acceptors for indexed languages
• Solvable problems for transformers with reversal-bounded counters
• Problems of inclusion and equivalence for program schemata and formal languages
• Decidability problems for meta-\(R\)-functions
• Quasirelations in a free group and transformator equivalence problems
• Regular algebra of functionals of labeled trees
• Equivalence problem of mappings relative to languages

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 Q5186756)