On Maximal Dead-end Recognizing Systems in the Class of Two-Element Subsets Concerning Operations of Intersection and Complement
Abstract
The structure of dead-end n{recognizing systems having a maximal possible length in the class of two-element subsets concerning the operations of intersection and complement is investigated. The quantity of such systems is estimated.
References
П. Эрдеш, Дж. Спенсер, Вероятностные методы в комбинаторике. Москва, ”Мир”, 1976.
С.М. Варданян, “Об одной задаче распознавания множеств”, ДАН Арм. ССР, том 72, сс. 141-143, 1981.
С.М. Варданян, “О длинах тупиковых распознающих систем в классе двух элементных подмножеств”, ДНАН РА, том 107, N1, сс. 37-43, 2007.
S.M. Vardanyan, “Recognizig sets (systems)" Proceedings of International Conference Computer Science and Information Technologies CSIT 05, pp. 161-162, Yerevan, Armenia 2005.
S.M. Vardanyan, “On the powers of dead-end recognizing systems in the class of two-element sets concerning operations of intersection and complement", Mathematical Problems of Computer Sciences, vol. 35, pp. 104-108, 2011.
С.М. Варданян, “О минимальности некоторых распознающих систем в классе двухэлементных подмножеств относительно операций пересечения и дополнения”, ДНАН РА, том 112, N1, сс. 57-66, 2012.
F. Harary, Graph Theory, Addison-Wesley. Reading MA 1969.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
