D:\sbornik\...\Article.DVI


Mathematical Problems of Computer Science 35, 104{108, 2011.

On the P ower s of Dead-end Recognizing Systems in

the Class of T wo-E lement Sets Concer ning Oper ations

of I nter section and Complement

S e yr a n M. V a r d a n ya n

Institute for Informatics and Automation Problems of NAS of RA
e-mail: seyranv@ipia.sci.am

Abstract

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

Refer ences

[1 ] Ñ. Ì. Âàðäàíÿí, “Î äëèíàõ òóïèêîâûõ ðàñïîçíàþùèõ ñèñòåì â êëàññå
äâóõýëåìåíòíûõ ïîäìíîæåñòâ”, ÄÀÍ ÍÀÍ ÐÀ, òîì 107, N 1, ñ ñ. 37 - 43, 2007.

[2] Ñ. Ì. Âàðäàíÿí, “Îá îäíîé çàäà÷å ðàñïîçíàâàíèÿ ìíîæåñòâ”, ÄÀÍ Àðì. ÑÑÐ, òîì
72, ñ ñ.141- 143, 1981.

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

[4] Ñ. Ì. Âàðäàíÿí, “Î ìèíèìàëüíîñòè íåêîòîðûõ ðàñïîçíàþùèõ ñèñòåì â
êëàññå äâóõýëåìåíòíûõ ïîäìíîæåñòâ îòíîñèòåëüíî îïåðàöèé ïåðåñå÷åíèÿ è
äîïîëíåíèÿ”, (to appear in the Reports of NAS of RA).

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

гïÙ³Ý ¨ Éñ³óÙ³Ý ·áñÍáÕáõÃÛáõÝÝ»ñÇ Ýϳïٳٳµ »ñÏï³ññ³ÝÇ
µ³½ÙáõÃÛáõÝÝ»ñÇ ¹³ëáõ٠׳ݳãáÕ ÷³ÏáõÕ³ÛÇÝ

ѳٳϳñ·»ñÇ Ñ½áñáõÃÛáõÝÝ»ñÇ Ù³ëÇÝ

ê. ì³ñ¹³ÝÛ³Ý

²Ù÷á÷áõÙ

²ß˳ï³ÝùáõÙ ë³ÑÙ³ÝíáõÙ ¿ n-ï³ññ³ÝÇ µ³½ÙáõÃÛ³Ý n-׳ݳãáÕ Ñ³Ù³Ï³ñ·
ѳëϳóáõÃÛáõÝÁ Áëï µ³½ÙáÃÛáõÝÝ»ñÇ Ñ³ïÙ³Ý áõ Éñ³óÙ³Ý ·áñÍáÕáõÃÛáõÝÝ»ñÇ ¨
»ñÏï³ññ³ÝÇ »Ýóµ³½ÙáõÃÛáõÝÝ»ñÇ ¹³ëáõÙ ·Ý³Ñ³ïíáõÙ ¿ ÷³ÏáõÕ³ÛÇÝ n-׳ݳãáÕ
ѳٳϳñ·»ñÇ Ñ½áñáõÃÛáõÝÝ»ñÇ µáÉáñ Ñݳñ³íáñ ³ñÅ»ùÝ»ñÁ:

1 0 4