the article describes a variant of setting sequential algorithms in the form of bipartite graphs by further defining them, which makes it possible to work with algorithms using graph theory methods in the future. Two forms of the task are considered: modular and functional-predicative. The possibility of setting the algorithm in table-predicate form is shown. It is concluded that in addition to the generally accepted methods of setting the algorithm, it can be set in matrix-predicate or table-predicate form, which allows using methods of matrix theory and methods of predicate theory when working with algorithms. setting the algorithm in matrix-predicate form avoids isomorphism when performing algebraic and set-theoretic operations on it.; setting algorithms in matrix-predicate form allows you to perform almost any operations on them

Keywords: graph-algorithm scheme, sequential algorithm, predicative block, functional block, pre-definition, bipartite graph, table-predicative form, graph theory, isomorphism

Finite state machines, being a mathematical abstraction, allow you to perceive information from the control object, process it and give signals to control the object. The disadvantages of the representation of complex production systems by a set of finite state machines include the complexity of carrying out logical and set-theoretic operations on them and the complexity of describing the parallelism that occurs in the operation of complex production systems. When specifying a finite state machine in the matrix–predicate form, due to the information redundancy, it is possible to avoid these difficulties. Matrix–predicate method allows you to uniquely set the finite state machine square matrix, which makes it possible to use the methods of the theory of matrices during the set–theoretic operations on them and it is possible to avoid isomorphism. The paper presents the developed methods of representation of a finite state machine using a multi-place predicate, which greatly simplifies its task.

Keywords: finite state machine, graph, matrix, predicate, algorithm, matrix–predicate method, graph incident, tuple, Cartesian product, complex production systems

At present, modern information technologies are actively used in the design of complex equipment at various industrial enterprises – automated systems for end-to-end CAD/CAM/CAE class design, which provide complex execution of design work with a significant reduction in their execution time while improving the quality of work. When this is achieved the main objective which is the update of the nomenclature of products, reducing costs, improving reliability, efficiency, etc. In view of this, the task of constructing and visualizing solid-state models is relevant today. From the analysis of the literature, it was concluded that today there are not enough methodological techniques for building models, and the existing developments do not contain optimal algorithms for creating 3D models of parts of varying complexity. Therefore, to implement the above problem, an algorithm for constructing a 3D model with a cutout was proposed.

Keywords: CAD/CAM/CAE, graphic packages, projection drawing, computer graphics, construction algorithm, geometric body, solid modeling, software, 3D model, surface toning

The article describes the algorithm of recognition of schematic diagrams in the framework of structural design of complex technical objects. It is specified that at statement of a problem of development of the specialized vectorizer it is necessary to define: software subsystems of the simplest tracer; algorithms of the analysis of images; formats of representation of the end result; initial data (formats) for recognition. As a result, it was concluded that for structural and circuit design, during which the vertex of the final portrait of the graph of the projected system is replaced, obtained after optimization by the criterion of the set of the smallest external stability, it is necessary to recognize images of graphic elements. The proposed algorithm allows for adequate recognition of the elements of electronic circuits, which further makes it possible to automatically replenish the database of elements with new elements in a given format.

Keywords: vectorization, concept recognition algorithm, structural design, graphic, element, raster image, electronic circuits, semi-graphical display, block-the functional distribution of the tracer