Abstract
Schemes of programs without procedures are considered, and a rich family of scheme equivalences is studied. The known properties of the structure of equivalent schemes make it possible to build, for each equivalence relation, an algorithm of polynomial complexity recognizing the equivalence and a complete system of equivalent transformations of schemes.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Podlovchenko, R.I., On a General Solution to the Problem of Equivalent Transformations of Program Schemes (I),Programmirovanie, 2000, no. 1.
Podlovchenko, R.I. and Airapetyan, M.G., On the Construction of Complete Systems of Equivalent Transformations of Program Schemes,Programmirovanie, 1996, no. 1, pp. 3–29.
Podlovchenko, R.I., A Canonization Algorithm for Pairs of Program Schemes with Commuting Operators,Programmirovanie, 1997, no. 6, pp. 3–16.
Podlovchenko, R.I., A Transformation System Complete in a Class of Program Schemes with Commuting Operators,Programmirovanie, 1998, no. 2, pp. 58–67.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Podlovchenko, R.I. On a general solution to the problem of equivalent transformations of program schemes (II). Program Comput Soft 26, 53–60 (2000). https://doi.org/10.1007/BF02759191
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02759191