Pages that link to "Item:Q4041106"
From MaRDI portal
The following pages link to Decidable Properties of Monadic Functional Schemas (Q4041106):
Displaying 16 items.
- Algorithm for verifying the equivalence of linear unary recursive programs on ordered semigroup scales (Q357923) (← links)
- The complexity of monadic recursion schemes: executability problems, nesting depth, and applications (Q792758) (← links)
- The complexity of monadic recursion schemes: Exponential time bounds (Q796301) (← links)
- Programs as partial graphs. I: Flow equivalence and correctness (Q1168723) (← links)
- Programs as partial graphs. II: Recursion (Q1168724) (← links)
- Program equivalence and context-free grammars (Q1221492) (← links)
- The inclusion problem for simple languages (Q1235014) (← links)
- On the completeness of the inductive assertion method (Q1236426) (← links)
- Equivalence problems for deterministic context-free languages and monadic recursion schemes (Q1238426) (← links)
- A direct algorithm for checking equivalence of LL(k) grammars (Q1238431) (← links)
- An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines (Q1239606) (← links)
- IO and OI. I (Q1241985) (← links)
- IO and OI. II (Q1243578) (← links)
- On some classes of interpretations (Q1251892) (← links)
- Monadic recursion schemes: The effect of constants (Q1259576) (← links)
- Program equivalence checking by two-tape automata (Q2452753) (← links)
