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

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

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Programming and computer software 2000-03, Vol.26 (2), p.53-60
1. Verfasser: Podlovchenko, R. I.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Equivalence
Polynomials
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0361-7688
1608-3261
DOI:10.1007/BF02759191