The tree equivalence problem for linear recursion schemes

DOI10.1007/3-540-62064-8_29MaRDI QIDQ6570936zbMATH OpenFDO

Authors Viktor K. Sabelfeld

Publication date 11 July 2024

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)

Cites work

• scientific article; zbMATH DE number 46687 (Why is no real title available?)
• A representation of trees by languages. II
• An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines
• DPDA's in 'Atomic normal form' and applications to equivalence problems
• Monotone data flow analysis frameworks
• On jump-deterministic pushdown automata
• Program equivalence and context-free grammars
• Tree equivalence of linear recursive schemata is polynomial-time decidable
• Variations on the Common Subexpression Problem

This page was built for publication: The tree equivalence problem for linear recursion schemes

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