MODEL OF EXTENDED NOTATION OF ALGORITHM FORMULAS TEXTUAL DESCRIPTION

O. V. Ovsiak

Abstract


The proposed extended xml-notation of algorithm formulas description provides writing of graphical-textual algorithm formulas formed by functional uniterms with ordered variables and parameters in the computer memory. The extended notation model is described by means of algorithm algebra using the sequencing operation. The example of Euclid algorithm formula description using the extended notation is given in the paper.

Keywords


model, notation, syntax, semantics, uniterm, sequencing, elimination, paralleling.

GOST Style Citations






DOI: https://doi.org/10.15588/1607-3274-2011-1-16



Copyright (c) 2014 O. V. Ovsiak

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Address of the journal editorial office:
Editorial office of the journal «Radio Electronics, Computer Science, Control»,
Zaporizhzhya National Technical University, 
Zhukovskiy street, 64, Zaporizhzhya, 69063, Ukraine. 
Telephone: +38-061-769-82-96 – the Editing and Publishing Department.
E-mail: rvv@zntu.edu.ua

The reference to the journal is obligatory in the cases of complete or partial use of its materials.