On program schemata equivalence

Authors:
V. E. Itkin;V. E. Itkin;Z. Zwinogrodzki
Affiliations:
-;-;-
Venue:
Journal of Computer and System Sciences
Year:
1972

Citing 5
Cited 2

On Ianov's Program Schemata

Journal of the ACM (JACM)
Program schemata as automata

SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
Regular expressions and the equivalence of programs

Journal of Computer and System Sciences
Parallel program schemata

Journal of Computer and System Sciences
On formalised computer programs

Journal of Computer and System Sciences

The Equivalence Problem for Computational Models: Decidable and Undecidable Cases

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
A Comparison of Some Theoretical Models of Parallel Computation

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Some problems related to the class of program schemata introduced by R. M. Karpand R. M. Miller in paper [1] are solved in this paper. The method of the proof implemented in the paper allows us to obtain a negativesolution of the existence problem of an algorithm for equivalence recognition for a wide class of program schemata which can be reduced to the above class, and for a wide class of equivalence definitions.