Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
New method for the synthesis of algorithm formulae based on the concept of algorithm algebra is presented. The concept of algorithm algebra there is shown in papers [1-4]. The synthesis is performed in two stages. First, all sequences are formulated, which is followed by the bonding the sequences by conditions. This operation is termed by elimination. If the algorithm contains a cyclic operations, then each cyclic operation is considered as a complex one, over which the synthesis of sequences and eliminations are successively performed. Additionally, the algorithm algebra tools for transformation and minimization of algorithms are illustrated by a simple but instructive example.
Wydawca
Czasopismo
Rocznik
Tom
Strony
21--23
Opis fizyczny
Bibliogr. 4 poz., wzory
Twórcy
autor
- Kielce University of Technology, Al. Tysiaclecia Panstwa Polskiego 7, 25-314, Kielce, Poland
- Ukrainian Academy of Printing, Pid Goloskom 19, 79-020, Lviv, Ukraine
autor
- National University of Culture and Arts, Shuchevitcha 5, 79-020 Lviv, Ukraine
Bibliografia
- [1] Owsiak W., Owsiak A.: Rozszerzenie algebry algorytmów. Pomiary Automatyka Kontrola. No. 2, 2010, pp. 184-188.
- [2] Ovsyak A. V., Ovsyak V. K.: Modificirowana algebra algoritmov i instrumentalny sredstva obrabotki formul algebry algoritmiv. Upravlajuszczije systemy i maszyny. No. 1, 2013. pp. 27–36.
- [3] Ovsyak O.: Comparison of algebraic methods for algorithm transform. Pomiary Automatyka Kontrola. No. 10, 2013, pp. 1046-1048.
- [4] Ovsyak O.: Algebraic models of subsystems of abstract system with the user interface. Pomiary Automatyka Kontrola. No. 11, 2013, pp. 1179-1182.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-3fcca84e-57b1-41e4-bfa2-de4007881b7f