The tree equivalence of linear recursion schemes

DOI10.1016/S0304-3975(98)00207-2zbMath0944.68080OpenAlexW1973398888MaRDI QIDQ1575234

Viktor K. Sabelfeld

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00207-2

zbMATH Keywords

transformation rulesrecursion schemestree equivalence

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) General topics in the theory of software (68N01)

Cites Work

• Unnamed Item
• DPDA's in 'Atomic normal form' and applications to equivalence problems
• Tree equivalence of linear recursive schemata is polynomial-time decidable
• Program equivalence and context-free grammars
• An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines
• Monotone data flow analysis frameworks
• A representation of trees by languages. I
• Variations on the Common Subexpression Problem
• On jump-deterministic pushdown automata
• The equivalence problem for deterministic finite-turn pushdown automata

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