Pages that link to "Item:Q1162152"

The following pages link to Tree equivalence of linear recursive schemata is polynomial-time decidable (Q1162152):

Displaying 4 items.

• Some equivalent transformations of recursive programs based on their schematic properties (Q794422) (← links)
• The tree equivalence of linear recursion schemes (Q1575234) (← links)
• On the Decidability of the Equivalence Problem for Monadic Recursive Programs (Q4508638) (← links)
• The tree equivalence problem for linear recursion schemes (Q6570936) (← links)