scientific article; zbMATH DE number 3894494

MaRDI QIDQ5186756zbMATH OpenFDO

Authors L. P. Lisovik

Publication date 1984

zbMATH Keywords

bounded transformersdecidability of the equivalence problemprogram schemata

Mathematics Subject Classification ID

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

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

Cited in

(10)

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

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)