Abstract
This paper deals with the problem of mathematical safes on matrices with locks of different types. The method of subsystems separation is used, which was developed and substantiated in previous author’s works for simpler safe types. The problem for safes with locks of two types is investigated. Examples of solving the problem are given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. A. Donets, “Solution of safe problem on (0,1)-matrices,” Cybernetics and Systems Analysis, Vol. 38, No. 1, 83–88 (2002).
G. A. Donets and A. L. Gurin, “Problem of mathematical safe of two state locks,” Journal of Automation and Information Sciences, Vol. 50, No. 9, 51–59 (2018).
A. G. Donets and A. L. Gurin, “The problem of a mathematical safe with a prime number of lock states,” Journal of Automation and Information Sciences, Vol. 50, No. 11, 19–28 (2018).
Agai Ag Hamish Yakub and G. A. Donets, “The problem of a mathematical safe on matrices,” Theory of Optimal Solutions, 124–130 (2013).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 4, July–August, 2019, pp. 166–175.
Rights and permissions
About this article
Cite this article
Gurin, A.L. Methods for Solving Problems of Mathematical Safes on Matrices with Different Types of Locks. Cybern Syst Anal 55, 667–676 (2019). https://doi.org/10.1007/s10559-019-00176-x
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-019-00176-x