The following pages link to (Q4146243):
Displaying 20 items.
- The complexity of monadic recursion schemes: Exponential time bounds (Q796301) (← links)
- An algorithm deciding functional equivalence in a new class of program schemes (Q912596) (← links)
- Recursion-closed algebraic theories (Q1157899) (← links)
- The IO- and OI-hierarchies (Q1161273) (← links)
- Program schemata with polynomial bounded counters (Q1216043) (← links)
- Program equivalence and context-free grammars (Q1221492) (← links)
- The computational complexity of program schemata (Q1223162) (← links)
- Effective proper procedures and universal classes of program schemata (Q1236424) (← 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)
- IO and OI. I (Q1241985) (← links)
- IO and OI. II (Q1243578) (← links)
- The tree equivalence of linear recursion schemes (Q1575234) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- Counter machines (Q1606993) (← links)
- Quasirelations in a free group and transformator equivalence problems (Q1820772) (← links)
- Transformations of sequential specifications into concurrent specifications by synchronization guards (Q2638794) (← links)
- Regular algebra of functionals of labeled trees (Q3742755) (← links)
- Functional systems: Theoretical and practical aspects (Q3886853) (← links)
- Functionality problem in a class of relation schemas (Q3951519) (← links)
