RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika. Supplement // Archive

Prikl. Diskr. Mat. Suppl., 2016 Issue 9, Pages 10–12 (Mi pdma267)

Theoretical Foundations of Applied Discrete Mathematics

An algorithm for recognizing the completeness of a set of words and dynamics of prohibitions

A. A. Evdokimov

Sobolev Institute of Mathematics, Novosibirsk

Abstract: Some reduction operations on a set of words are introduced. For recognizing the completeness of such sets, an algorithm using these operations is proposed. A theorem substantiating the algorithm is given.

Keywords: a set of words, completeness, dynamics, prohibitions, algorithm, recognition.

UDC: 519.7

DOI: 10.17223/2226308X/9/3



© Steklov Math. Inst. of RAS, 2026