The following pages link to On formalised computer programs (Q2543556):
Displaying 48 items.
- A survey of state vectors (Q458456) (← links)
- Solution of the generalized minimization problem for two-tape automata with one fixed tape (Q610515) (← links)
- On the non-compactness of the class of program schemas (Q759008) (← links)
- Necessary and sufficient conditions for the universality of programming formalisms (Q801666) (← links)
- An algorithm deciding functional equivalence in a new class of program schemes (Q912596) (← links)
- Inference rules for proving the equivalence of recursive procedures (Q938300) (← links)
- The equivalence problem of multidimensional multitape automata (Q955343) (← links)
- A view of computability on term algebras (Q1051428) (← links)
- The logic-termal equivalence is polynomial-time decidable (Q1144374) (← links)
- Observations on the complexity of regular expression problems (Q1149249) (← links)
- The independence of control structures in abstract programming systems (Q1155949) (← links)
- The IO- and OI-hierarchies (Q1161273) (← links)
- Programs as partial graphs. I: Flow equivalence and correctness (Q1168723) (← links)
- Definability by programs in first-order structures (Q1171876) (← links)
- The functional dimension of inductive definitions (Q1193414) (← links)
- Program schemata and the first-order decision problem (Q1213300) (← links)
- Program schemata as automata. I (Q1214748) (← 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)
- Function iteration logics and flowchart schemata (Q1226854) (← links)
- Completeness results for the equivalence of recursive schemas (Q1232171) (← links)
- Finiteness is mu-ineffable (Q1236111) (← links)
- Effective proper procedures and universal classes of program schemata (Q1236424) (← links)
- An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines (Q1239606) (← links)
- Una classe di schemi ricorsivi non-deterministici paralleli (Q1240551) (← links)
- Äquivalente Transformationen für Flußdiagramme (Q1249431) (← links)
- Program transformations and algebraic semantics (Q1254849) (← links)
- Modifications of the program scheme model (Q1258173) (← links)
- Monadic recursion schemes: The effect of constants (Q1259576) (← links)
- On approximate and algebraic computability over the real numbers (Q1292404) (← links)
- Program schemes, recursion schemes, and formal languages (Q1393937) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- On self-modifying programs (Q1845615) (← links)
- Equivalence of conservative, free, linear program schemas is decidable (Q1853616) (← links)
- John McCarthy (1927--2011) (Q1941856) (← links)
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond (Q2117588) (← links)
- Automaton semigroup models of programs (Q2371659) (← links)
- Program equivalence checking by two-tape automata (Q2452753) (← links)
- Equivalences on program schemes (Q2543557) (← links)
- Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems (Q2559259) (← links)
- On program schemata equivalence (Q2559261) (← links)
- Characterization of flowchartable recursions (Q2562565) (← links)
- Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism (Q2974777) (← links)
- Equational Theories of Abnormal Termination Based on Kleene Algebra (Q2988362) (← links)
- On the computational complexity of dynamic slicing problems for program schemas (Q3103616) (← links)
- Minimality and deadlockness of multitape automata (Q3184541) (← links)
- Some applications of topology to program semantics (Q3340119) (← links)
