Investigating s-model programs for the purpose of reducing them to canonical form (Q1083840)

At the heart of this article is the problem of equivalence conversions for program diagrams. The initial problem is one of purpose: solving the problem in a class of diagrams is preceded by constructing an algorithm for the solution that reduces the two diagrams to canonical form. The problems of choosing the prospective classes of diagrams for seeking an algorithm that will reduce the diagrams to canonical form and solving them in a large set of programming diagrams are formulated.