Abstract
We consider columns-based intelligent systems with patterns containing duplicates, i.e., forming finite multisets. A representation of such patterns is suggested and solutions to the direct and inverse problems are discussed. The intersection method serves for solving the both problems.
Similar content being viewed by others
References
Aigner, M., Combinatorial Theory, Berlin: Springer-Verlag, 1979. Translated under the title Kombinatornaya teoriya, Moscow: Mir, 1982.
Petrovsky, A.B., Osnovnye ponyatiya teorii mul’timnozhestv (Basic Concepts of Multiset Theory), Moscow: Editorial URSS, 2002.
Chesnokov, A.M., Columns-based Intelligent Systems, Upravlen. Bol’shimi Sist., 2013, no. 46, pp. 118–146.
Chesnokov, A.M., Columns-based Intelligent Systems under Incomplete Information, Upravlen. Bol’shimi Sist., 2014, no. 50, pp. 84–98.
Chesnokov, A.M., Vvedenie v obshchuyu teoriyu kolonok (Introduction to General Columns Theory), Moscow: Inst. Probl. Upravlen., 2012.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.M. Chesnokov, 2012, published in Upravlenie Bol’shimi Sistemami, 2012, No. 36, pp. 23–36.
Rights and permissions
About this article
Cite this article
Chesnokov, A.M. Finite multisets as patterns in column-based intelligent systems. Autom Remote Control 76, 1681–1688 (2015). https://doi.org/10.1134/S0005117915090143
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117915090143