journal article Jan 01, 2000

On a general solution to the problem of equivalent transformations of program schemes

View at Publisher Save 10.1007/bf02759181
Topics

No keywords indexed for this article. Browse by subject →

References
6
[1]
Podlovchenko, R.I., From Yanov’s Schemes to the Theory of Program Models, inMathematicheskie voprosy kibernetiki (Mathematical Problems of Cybernetics), Moscow: Nauka, 1998, issue 7, pp. 281–302.
[2]
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.
[3]
Podlovchenko, R.I., A Canonization Algorithm for Pairs of Program Schemes with Commuting Operators,Programmirovanie, 1997, no. 6, pp. 3–16.
[4]
Podlovchenko, R.I., A Transformation System Complete in the Class of Program Schemes with Commuting Operators,Programmirovanie, 1998, no. 2, pp. 58–67.
[5]
Glushkov, V.M. and Letichevskii, A.A., The Theory of Discrete Transformers, inIzbrannye voprosy algebry i logiki (Selected Issues of Algebra and Logics), Novosibirsk: Nauka, 1973, pp. 5–39.
[6]
Zakharov, V.A., Fast Algorithms for Solving the Equivalence of Operator Programs on Balanced Scales, inMatematicheskie voprosy kibernetiki (Mathematical Problems of Cybernetics), Moscow: Nauka, 1998, issue 7, pp. 303–324.
Metrics
3
Citations
6
References
Details
Published
Jan 01, 2000
Vol/Issue
26(1)
Pages
44-52
License
View
Cite This Article
R. I. Podlovchenko (2000). On a general solution to the problem of equivalent transformations of program schemes. Programming and Computer Software, 26(1), 44-52. https://doi.org/10.1007/bf02759181
Related

You May Also Like