scientific article

zbMath0085.34003MaRDI QIDQ3256561

Yu. I. Yanov

Publication date: 1958

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

practical analysis

Mathematics Subject Classification ID

Analytic circuit theory (94C05) Theory of software (68N99) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (24)

Verification and comparison of transition systems ⋮ Automaton semigroup models of programs ⋮ An algebraic approach to semantics of programming languages ⋮ Technique of traces in solving the equivalence problem in algebraic program models ⋮ A propositional logic of Boolean recursive programs in which predicate variables appear in conditions ⋮ Algebra of algorithms and Kaluzhnin's graph-schemas ⋮ Functional completeness criteria in Dijkstra algebra ⋮ An algorithm deciding functional equivalence in a new class of program schemes ⋮ Program schemata technique for propositional program logics: a 30-year history ⋮ Modular Verification of Procedure Equivalence in the Presence of Memory Allocation ⋮ Program equivalence checking by two-tape automata ⋮ Efficient algorithms for checking the equivalence of programs in interrupt handling models ⋮ Complete systems of equivalent transformations in balanced semigroup models of programs with left cancellation ⋮ Bounded monotone recursion and multihead automata ⋮ Minimization of logical schemes of algorithms ⋮ Recursive converters on a memory ⋮ Parallel program schemata ⋮ Problems on automation of computer and system design ⋮ Semantics of algorithmic languages ⋮ Functional completeness in iterative meta-algebras ⋮ On program schemata equivalence ⋮ Recursive information transducers: Computation models ⋮ Issues of algorithmics and Glushkov's systems of algorithmic algebras ⋮ Structural models of algorithms in problems of applied programming. I: Formal algorithmic structures

This page was built for publication: