Structural models of algorithms in problems of applied programming. I. Formal algorithmic structures

Authors:
V. I. Shynkarenko;V. M. Ilman;V. V. Skalozub
Affiliations:
V. Lazaryan Dnepropetrovsk National University of Railway Transport, Dnepropetrovsk, Ukraine;V. Lazaryan Dnepropetrovsk National University of Railway Transport, Dnepropetrovsk, Ukraine;V. Lazaryan Dnepropetrovsk National University of Railway Transport, Dnepropetrovsk, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2009

Citing 4
Cited 0

Algorithmic algebra

Algorithmic algebra
Structured Programming; Theory and Practice the Systems Programming Series

Structured Programming; Theory and Practice the Systems Programming Series
Code Optimization: Effective Memory Usage

Code Optimization: Effective Memory Usage
Transformational reducibility and synthesis of algorithms and programs of symbolic processing

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

A structural approach to modelling algorithms is proposed. The concept of an algorithmic structure with operations over algorithms is introduced. Models of algorithms constructed from algorithmic structures reflect aspects of algorithm representation and execution. Examples of structural and path models of algorithms are considered.