The tree equivalence problem for linear recursion schemes
From MaRDI portal
Publication:6570936
DOI10.1007/3-540-62064-8_29zbMATH Open1541.68111MaRDI QIDQ6570936FDOQ6570936
Authors: Viktor K. Sabelfeld 
Publication date: 11 July 2024
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
- Variations on the Common Subexpression Problem
- Monotone data flow analysis frameworks
- A representation of trees by languages. II
- DPDA's in 'Atomic normal form' and applications to equivalence problems
- An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines
- Tree equivalence of linear recursive schemata is polynomial-time decidable
- Program equivalence and context-free grammars
- On jump-deterministic pushdown automata
- Title not available (Why is that?)
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)
