An algorithm for recognizing the completeness of a~set of words and dynamics of prohibitions
Prikladnaya Diskretnaya Matematika. Supplement, no. 9 (2016), pp. 10-12
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
@article{PDMA_2016_9_a2,
author = {A. A. Evdokimov},
title = {An algorithm for recognizing the completeness of a~set of words and dynamics of prohibitions},
journal = {Prikladnaya Diskretnaya Matematika. Supplement},
pages = {10--12},
publisher = {mathdoc},
number = {9},
year = {2016},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDMA_2016_9_a2/}
}
TY - JOUR AU - A. A. Evdokimov TI - An algorithm for recognizing the completeness of a~set of words and dynamics of prohibitions JO - Prikladnaya Diskretnaya Matematika. Supplement PY - 2016 SP - 10 EP - 12 IS - 9 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/PDMA_2016_9_a2/ LA - ru ID - PDMA_2016_9_a2 ER -
A. A. Evdokimov. An algorithm for recognizing the completeness of a~set of words and dynamics of prohibitions. Prikladnaya Diskretnaya Matematika. Supplement, no. 9 (2016), pp. 10-12. http://geodesic.mathdoc.fr/item/PDMA_2016_9_a2/