Skip to main content
SpringerLink
Log in

Equivalent Transformations in the Model of Programs with Commuting and Monotone Operators

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

The fundamental problem in the theory of algebraic program models is considered. It consists in constructing a system of equivalent transformations of program schemes that is complete in the model. It is solved for a model different from those considered in earlier studies.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. 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.

    Google Scholar 

  2. Zakharov, V.A., The Equivalence Problem for Computational Models: Decidable and Undecidable Cases, Lect. Notes Comput. Sci., 2001, vol. 2055, pp. 133-153.

    Google Scholar 

  3. Yanov, Yu.I., On Logical Algorithm Schemes, Probl. Kibern., Moscow: Fizmatgiz, 1958, issue 1, pp. 75-127.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. Podlovchenko, R.I., Khachatryan, V.E., and Chashin, Yu.G., A Complete Systems of Equivalent Transformations for Two-Tape Automaton with Nonoverlapping Cycles, Programmirovanie, 2000, no. 5, pp. 3-17.

    Google Scholar 

  6. Podlovchenko, R.I., On a General Solution to the Problem of Equivalent Transformations of Program Schemes. Part I, Programmirovanie, 2000, no. 1, pp. 64-77.

    Google Scholar 

  7. Podlovchenko, R.I., On a General Solution to the Problem of Equivalent Transformations of Program Schemes. Part II, Programmirovanie, 2000, no. 2, pp. 3-11.

    Google Scholar 

  8. Podlovchenko, R.I., Solvability of the Equivalence in the Set of Program Schemes with Monotone and Partially Commuting Operators, Programmirovanie, 1990, no. 5, pp. 3-12.

    Google Scholar 

  9. Podlovchenko, R.I., A Canonization Algorithm for Pairs of Program Schemes with Commuting Operators, Programmirovanie, 1997, no. 6, pp. 3-16.

    Google Scholar 

  10. Podlovchenko, R.I., A Transformation System Complete in the Class of Program Schemes with Commuting Operators, Programmirovanie, 1998, no. 2, pp. 58-67.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Research Center, Moscow State University, Vorob'evy gory, Moscow, 119899, Russia

    R. I. Podlovchenko

Authors
  1. R. I. Podlovchenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Podlovchenko, R.I. Equivalent Transformations in the Model of Programs with Commuting and Monotone Operators. Programming and Computer Software 28, 301–313 (2002). https://doi.org/10.1023/A:1021073225435

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021073225435

Keywords

Search

Navigation