Abstract
An algebraic model of programs called program schemes with constants is considered. For the class of schemes belonging to this model that use each constant not more than once, the inclusion problem for schemes is solved; this implies the solvability of the scheme equivalence problem in this class.
Similar content being viewed by others
REFERENCES
Podlovchenko, R.I., From Yanov’s Schemes to the Theory of Program Models, Matematicheskie voprosy kibernetiki (Mathematical Problems of Cybernetics), Moscow: Nauka, 1998, issue 7, pp. 281–302.
Lisovik, L.P., Metalinear Schemes with Writing Constants, Programmirovanie, 1985, no. 2, pp. 29–38.
Podlovchenko, R.I., Derived Problems for Program Schemes with Constants, Trudy 4 Mezhdunarodnoi konferentsii “Diskretnye modeli v teorii upravlyayushchikhsistem” (Proc. 4th Int. Conf. on Discrete Models in the Theory of Control Systems), Moscow: Maks-Press, 2000, pp. 112–114.
Podlovchenko, R.I. and Rusakov, D.M., A Canonical Form of a Program Scheme with a Single Occurrence of a Constant, Trudy 5 Mezhdunarodnoi konferentsii “Diskretnye modeli v teorii upravlyayushchikh sistem” (Proc. 5th Int. Conf. on Discrete Models in the Theory of Control Systems), Ratmino, 2003, Moscow: Mosk. Gos. Univ., 2003, pp. 65–66.
Podlovchenko, R.I., Equivalent Transformations of Program Schemes for “Entangling” Programs, Programmirovanie, 2002, no. 2, pp. 66–80.
Author information
Authors and Affiliations
Additional information
__________
Translated from Programmirovanie, Vol. 31, No. 3, 2005.
Original Russian Text Copyright © 2005 by Podlovchenko, Rusakov.
Rights and permissions
About this article
Cite this article
Podlovchenko, R.I., Rusakov, D.M. Program Schemes with Constants. Program Comput Soft 31, 113–122 (2005). https://doi.org/10.1007/s11086-005-0024-6
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11086-005-0024-6