Pages that link to "Item:Q3773319"
From MaRDI portal
The following pages link to Decidable subcases of the equivalence problem for recursive program schemes (Q3773319):
Displaying 9 items.
- The undecidability of some equivalence problems concerning ngsm's and finite substitutions (Q1269922) (← links)
- The tree equivalence of linear recursion schemes (Q1575234) (← links)
- On the decidability of the equivalence problem for orthogonal sequential programs (Q1592932) (← links)
- A note on the decidability of subword inequalities (Q2856016) (← links)
- (Q3635984) (← links)
- Decidable problems for powerful programs (Q3766814) (← links)
- On the Decidability of the Equivalence Problem for Monadic Recursive Programs (Q4508638) (← links)
- The decidable properties of subrecursive functions (Q4598249) (← links)
- Automata, Languages and Programming (Q5716839) (← links)