Tree equivalence of linear recursive schemata is polynomial-time decidable (Q1162152)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tree equivalence of linear recursive schemata is polynomial-time decidable |
scientific article; zbMATH DE number 3754043
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tree equivalence of linear recursive schemata is polynomial-time decidable |
scientific article; zbMATH DE number 3754043 |
Statements
Tree equivalence of linear recursive schemata is polynomial-time decidable (English)
0 references
1981
0 references
recursive scheme
0 references
function call
0 references
marking algorithm
0 references
equivalence problem
0 references
equivalence over interpretations
0 references
recognizing algorithm
0 references
global flow analysis problem
0 references
0 references
