|
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.
Citation:
A. A. Evdokimov, “An algorithm for recognizing the completeness of a set of words and dynamics of prohibitions”, Prikl. Diskr. Mat. Suppl., 2016, no. 9, 10–12
Linking options:
https://www.mathnet.ru/eng/pdma267 https://www.mathnet.ru/eng/pdma/y2016/i9/p10
|
Statistics & downloads: |
Abstract page: | 192 | Full-text PDF : | 51 | References: | 30 |
|