Pages that link to "Item:Q5609377"
From MaRDI portal
The following pages link to The Equivalence Problem of Simple Programs (Q5609377):
Displayed 12 items.
- Simple programming languages and restricted classes of Turing machines (Q792760) (← links)
- Some simplified undecidable and NP-hard problems for simple programs (Q1157168) (← links)
- On the complexity of simple arithmetic expressions (Q1162150) (← links)
- On the zero-inequivalence problem for loop programs (Q1171383) (← links)
- Function iteration logics and flowchart schemata (Q1226854) (← links)
- Toward a mathematical theory of graph-generative systems and its applications (Q1237578) (← links)
- Linear programs in a simple reversible language. (Q1401215) (← links)
- A note on comparison of subrecursive hierarchies (Q2551316) (← links)
- A note on the complexity of program evaluation (Q3319774) (← links)
- (Q4186306) (← links)
- Some Hierarchies of Primitive Recursive Functions on Term Algebras (Q4336703) (← links)
- ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS (Q4923290) (← links)