Publication:5517672
From MaRDI portal
zbMath0142.24801MaRDI QIDQ5517672
Publication date: 1960
68N99: Theory of software
Related Items
Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time, A note on an expressiveness hierarchy for multi-exit iteration, Probabilistic Ianov's schemes, The equivalence of r.e. program schemes and data flow schemes, Equivalence of free Boolean graphs can be decided probabilistically in polynomial time, A complete logic for reasoning about programs via nonstandard model theory. I, Program transformations and algebraic semantics, Monadic recursion schemes: The effect of constants, On approximate and algebraic computability over the real numbers, An equational axiomatization for multi-exit iteration, The equational logic of fixed points, Program schemes, recursion schemes, and formal languages, \(L(A)=L(B)\)? decidability results from complete formal systems, Equivalence of conservative, free, linear program schemas is decidable, Regular expressions and the equivalence of programs, On formalised computer programs, Translating recursion equations into flow charts, Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems, Unnamed Item, Unnamed Item