Pages that link to "Item:Q1221492"

The following pages link to Program equivalence and context-free grammars (Q1221492):

Displaying 14 items.

• Some equivalent transformations of recursive programs based on their schematic properties (Q794422) (← links)
• Fundamental properties of infinite trees (Q1055184) (← links)
• A representation of trees by languages. II (Q1137390) (← links)
• DPDA's in 'Atomic normal form' and applications to equivalence problems (Q1158965) (← links)
• Tree equivalence of linear recursive schemata is polynomial-time decidable (Q1162152) (← links)
• Categories of chain-complete posets (Q1241798) (← links)
• A representation of trees by languages. I (Q1246271) (← links)
• The tree equivalence of linear recursion schemes (Q1575234) (← links)
• \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
• Recursion induction principle revisited (Q1838286) (← links)
• Infinite trees in normal form and recursive equations having a unique solution (Q3851585) (← links)
• Recursive converters on a memory (Q3885193) (← links)
• (Q4192947) (← links)
• The tree equivalence problem for linear recursion schemes (Q6570936) (← links)