Universal Linear Data Structure
Rustam Kabulov Vosilovich · 2020 International Conference on Information Science and Communications Technologies (ICISCT) · 2020
The paper is devoted to the relevant issue of formalizing the description of a universal linear data structure. In modern programming, various data structures are described as linear data structures. The paper presents general functions for performing operations on such data structures as vector, deck, list, set and multiset. The conditions that these functions must meet are introduced as axioms. To describe the axioms, an approach based on an abstract data type, algebraic and formal grammatical approaches were used.