The number of fixed points of the majority rule

Z. Agur; A. S. Fraenkel; S. T. Klein

doi:10.1016/0012-365x(88)90005-2

The number of fixed points of the majority rule

Z. Agur
, A. S. Fraenkel
, S. T. Klein

Weizmann Institute of Science

Research output: Contribution to journal › Article › peer-review

34 Scopus citations

Abstract

Formulae are derived for the number of cyclic binary strings of length n in which no single 1 occurs between two zeros and no single 0 occurs between two ones, and for the number of cyclic binary strings without substrings of the form 000 and 111. This problem is motivated by a problem of genetic information processing.

Original language	English
Pages (from-to)	295-302
Number of pages	8
Journal	Discrete Mathematics
Volume	70
Issue number	3
DOIs	https://doi.org/10.1016/0012-365x(88)90005-2
State	Published - Aug 1988
Externally published	Yes

Access to Document

10.1016/0012-365x(88)90005-2

Cite this

@article{2e243f1d99224cfcb4844b63442a1bc8,

title = "The number of fixed points of the majority rule",

abstract = "Formulae are derived for the number of cyclic binary strings of length n in which no single 1 occurs between two zeros and no single 0 occurs between two ones, and for the number of cyclic binary strings without substrings of the form 000 and 111. This problem is motivated by a problem of genetic information processing.",

author = "Z. Agur and Fraenkel, \{A. S.\} and Klein, \{S. T.\}",

year = "1988",

month = aug,

doi = "10.1016/0012-365x(88)90005-2",

language = "אנגלית",

volume = "70",

pages = "295--302",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - The number of fixed points of the majority rule

AU - Agur, Z.

AU - Fraenkel, A. S.

AU - Klein, S. T.

PY - 1988/8

Y1 - 1988/8

N2 - Formulae are derived for the number of cyclic binary strings of length n in which no single 1 occurs between two zeros and no single 0 occurs between two ones, and for the number of cyclic binary strings without substrings of the form 000 and 111. This problem is motivated by a problem of genetic information processing.

AB - Formulae are derived for the number of cyclic binary strings of length n in which no single 1 occurs between two zeros and no single 0 occurs between two ones, and for the number of cyclic binary strings without substrings of the form 000 and 111. This problem is motivated by a problem of genetic information processing.

UR - https://www.scopus.com/pages/publications/38249026814

U2 - 10.1016/0012-365x(88)90005-2

DO - 10.1016/0012-365x(88)90005-2

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:38249026814

SN - 0012-365X

VL - 70

SP - 295

EP - 302

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 3

ER -

The number of fixed points of the majority rule

Abstract

Access to Document

Other files and links

Fingerprint

Cite this