Pages that link to "Item:Q1232171"
From MaRDI portal
The following pages link to Completeness results for the equivalence of recursive schemas (Q1232171):
Displayed 12 items.
- Fundamental properties of infinite trees (Q1055184) (← links)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
- A representation of trees by languages. II (Q1137390) (← links)
- DPDA's in 'Atomic normal form' and applications to equivalence problems (Q1158965) (← links)
- A direct algorithm for checking equivalence of LL(k) grammars (Q1238431) (← links)
- A representation of trees by languages. I (Q1246271) (← links)
- On the Yoneda completion of a quasi-metric space (Q1605178) (← links)
- Recursion induction principle revisited (Q1838286) (← links)
- An axiomatic approach to the Korenjak-Hopcroft algorithms (Q3703289) (← links)
- Decidable subcases of the equivalence problem for recursive program schemes (Q3773319) (← links)
- Infinite trees in normal form and recursive equations having a unique solution (Q3851585) (← links)
- A fast algorithm to decide on the equivalence of stateless DPDA (Q5286053) (← links)