On the Powers of Dead-end Recognizing Systems in the Class of T wo-Element Sets Concerning Operations of ntersection and Complement

Authors

  • Seyran M. Vardanyan Institute for Informatics and Automation Problems of NAS RA

Abstract

The notion of n-recognizing system in the class of two-element sets concerning the operations of intersection and complement is defined. The set of powers of dead-end n-recognizing systems of such kind is estimated.

References

С. М. Варданян, “О длинах тупиковых распознающих систем в классе двухэлементных подмножеств”, ДАН НАН РА, том 107, N 1, с с. 37 - 43, 2007.

С. М. Варданян, “Об одной задаче распознавания множеств”, ДАН Арм. ССР, том 72, с с.141- 143, 1981.

S. M. Vardanyan, “Recognizig sets (systems) Computer Science and Information Technologies”, P rocedings of the conference CSIT05, pp.161 - 162, Yerevan, Armenia 2005.

С. М. Варданян, “О минимальности некоторых распознающих систем в классе двухэлементных подмножеств относительно операций пересечения и дополнения”, (to appear in the Reports of NAS of RA).

F. Harary, Graph Theory, Addison - Wesley. Reading MA 1969.

Downloads

Published

2021-12-10

How to Cite

Vardanyan, S. M. . (2021). On the Powers of Dead-end Recognizing Systems in the Class of T wo-Element Sets Concerning Operations of ntersection and Complement. Mathematical Problems of Computer Science, 35, 104–108. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/292