scientific article; zbMATH DE number 3229496
From MaRDI portal
Publication:5517672
zbMath0142.24801MaRDI QIDQ5517672
Publication date: 1960
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (26)
Concurrent Kleene algebra with tests and branching automata ⋮ Probabilistic Ianov's schemes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An equational axiomatization for multi-exit iteration ⋮ Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time ⋮ The equational logic of fixed points ⋮ Program schemes, recursion schemes, and formal languages ⋮ Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas ⋮ 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 ⋮ Unnamed Item ⋮ Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas ⋮ A survey of state vectors ⋮ Program transformations and algebraic semantics ⋮ Monadic recursion schemes: The effect of constants ⋮ A note on an expressiveness hierarchy for multi-exit iteration ⋮ 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 ⋮ On approximate and algebraic computability over the real numbers ⋮ \(L(A)=L(B)\)? decidability results from complete formal systems ⋮ Equivalence of conservative, free, linear program schemas is decidable ⋮ Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
This page was built for publication:
