Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс: https://r.donnu.edu.ua/handle/123456789/2373
Название: Block composition algorithm for constructing orthogonal n-ary operations
Авторы: Fryz, Iryna V.
Sokhatsky, Fedir M.
Ключевые слова: Orthogonality of operations
Retract orthogonality of operations
Composition algorithm
Block-wise recursive algorithm
Block composition algorithm
Дата публикации: 9-авг-2017
Издательство: journal homepage: www.elsevier.com/locate/disc
Серия/номер: Discrete Mathematics;Volume 340, Issue 8, August 2017, Pages 1957-1966
Краткий осмотр (реферат): We propose an algorithm for constructing orthogonal n-ary operations which is called a block composition algorithm here. Input data of the algorithm are two series of differ ent arity operations being distributed by blocks. The algorithm consists of two parts: composition algorithm for constructing n-ary operations with orthogonal retracts from given blocks of operations and block-wise recursive algorithm for constructing orthogonal n-ary operations from obtained operations. Obtained results are illustrated by examples of orthogonal n-ary operations which are constructible by block-wise recursive algorithm and non-constructible by the well-known trivial recursive algorithm.
Описание: Article in journal www.elsevier.com/locate/disc. Article history: Received 22 July 2015 Received in revised form 23 May 2016 Accepted 9 November 2016 Available online 4 December 2016
URI (Унифицированный идентификатор ресурса): http://dx.doi.org/10.1016/j.disc.2016.11.012
https://r.donnu.edu.ua/handle/123456789/2373
Располагается в коллекциях:Бібліографічні матеріали

Файлы этого ресурса:
Файл Описание РазмерФормат 
Fryz_Sokhatsky 2017.pdfArticle in journal www.elsevier.com/locate/disc. Article history: Received 22 July 2015 Received in revised form 23 May 2016 Accepted 9 November 2016 Available online 4 December 2016422,27 kBAdobe PDFПросмотреть/Открыть


Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.