On stabilization of an automaton model of migration processes

References

[1] S Kauffman; E. Weinberger, “The NK model of rugged fitness landscapes and its application to the maturation of the immune response”, J. Theor. Biology, 141:2 (1989), 211-245.10.1016/S0022-5193(89)80019-0Search in Google Scholar

[2] S. Kauffman, “Homeostasis and differentiation in random genetic control networks”, Nature, 224:5215 (1969), 177-178.10.1038/224177a0Search in Google Scholar PubMed

[3] M. Zh. Zholbaryssov, Yu. S. Shutkin, “Boolean networks stabilization problem”, Intelligent systems. Theory and applications, 21:4 (2017), 130-143 (in Russian).Search in Google Scholar

[4] Yu. S. Shutkin, “On the problem of Boolean network stabilization”, Intelligent systems. Theory and applications, 20:3 (2016), 85-89 (in Russian).Search in Google Scholar

[5] I. B. Kazakov, “The structure of a graph induced on the set of permutations ?? by an error model of a covert channel based on packet permutations”, Intelligent systems. Theory and applications, 22:2 (2018), 53-81 (in Russian).Search in Google Scholar

[6] È. È. Gasanov, “On the functional complexity of the two-dimensional domination problem”, Intelligent systems. Theory and applications, 21:4 (2017), 102-114 (in Russian).Search in Google Scholar

[7] K. Yu. Ananiev, “About methods of constructing LDPC-codes with preset characteristics”, Intelligent systems. Theory and applications, 21:3 (2017), 107-119 (in Russian).Search in Google Scholar

[8] R. A. Ishchenko, “Graphs of group automata”, Intelligent systems. Theory and applications, 21:2 (2017), 111-116 (in Russian).10.5687/sss.2017.111Search in Google Scholar

[9] V. V. Vedyushkina (Fokicheva), A. O. Ivanov, A. A. Tuzhilin, A. T. Fomenko, “Computer models in geometry and dynamics”, Intelligent systems. Theory and applications, 21:1 (2017), 164-191 (in Russian).Search in Google Scholar

[10] Yu. G. Chernova, “On the complexity time function of lung self-cleaning in some pathologies”, Intelligent systems. Theory and applications, 20:4 (2016), 143-153 (in Russian).Search in Google Scholar

[11] R. A. Ishchenko, “On decomposition of graph into subgraphs of special form”, Intelligent systems. Theory and applications, 20:4 (2016), 184-192 (in Russian).Search in Google Scholar

[12] È. È. Gasanov, A. A. Pletnev, “Modeling of dynamical databases”, Intelligent systems. Theory and applications, 20:3 (2016), 146-150 (in Russian).Search in Google Scholar

[13] A. A. Pletnev, “Lowest possible degree of branching information graph of radius visibility one that supports arbitrary query stream to a dynamic database”, Intelligent systems. Theory and applications, 20:1 (2016), 223-254 (in Russian).Search in Google Scholar

[14] E. A. Schulgina, “Assessment of parameters of biregular bipartite graphs”, Intelligent systems. Theory and applications, 20:1 (2016), 255-263 (in Russian).Search in Google Scholar

[15] I. Yu. Samonenko, “The number of regular languages recognized by group hyperautomata”, Intelligent systems. Theory andapplications, 22:2 (2018), 113-122 (in Russian).Search in Google Scholar

[16] A. A. Chasovskikh, “The problem of completeness in the class of linear automata”, Intelligent systems. Theory and applications, 22:2 (2018), 151-153 (in Russian).10.1515/dma-2016-0007Search in Google Scholar

[17] I. E. Ivanov, “On automata-based functions with store memory”, Intelligent systems. Theory and applications, 22:1 (2018), 39-110 (in Russian).Search in Google Scholar

[18] P. A. Panteleev, “A generalization of the Moore theorem”, Intelligent systems. Theory and applications, 22:1 (2018), 151-154 (in Russian).Search in Google Scholar

[19] D. V. Ronzhin, “Linear automata over rational numbers field”, Intelligent systems. Theory and applications, 21:4 (2017), 144-155 (in Russian).Search in Google Scholar

[20] S. B. Rodin, “On the properties of state encoding of an automaton”, Intelligent systems. Theory and applications, 21:1 (2017), 97-111 (in Russian).Search in Google Scholar

[21] I. E. Ivanov, “Estimate of the output sequence period for an autonomous one-counter pushdown-storage automata”, Intelligent systems. Theory and applications, 21:1 (2017), 112-148 (in Russian).Search in Google Scholar

[22] N. Yu. Volkov, V. V. Uschakova, “On the computability of functions by the group of two automata”, Intelligent systems. Theory and applications, 20:4 (2016), 21-24 (in Russian).Search in Google Scholar

[23] V. Gukasian, “Interconnection of automaton models of secure information systems without hidden data transfer channels”, Intelligent systems. Theory and applications, 20:4 (2016), 30-36 (in Russian).Search in Google Scholar

[24] D. N. Babin, “Class of superposition operation automata not extendable to a precomplete class”, Intelligent systems. Theory and applications, 20:4 (2016), 155-166 (in Russian).Search in Google Scholar

[25] I. E. Ivanov, “Improvement of the lower bound on the maximal period length of the output sequence of an autonomous store memory automaton”, Intelligent systems. Theory and applications, 20:3 (2016), 167-183 (in Russian).Search in Google Scholar

[26] A. A. Chasovskikh, “On completeness in the class of linear 2-adic automata”, Intelligent systems. Theory and applications, 20:4 (2016), 209-227 (in Russian).10.1515/dma-2016-0007Search in Google Scholar

[27] D. N. Babin, A. A. Letunovskii, “Algorithmically solvable cases in the expressibility problem of automata with respect to the superposition”, Intelligent systems. Theory and applications, 20:3 (2016), 98-100 (in Russian).Search in Google Scholar

[28] D. N. Babin, D. V. Parkhomenko, “On the multiset of output words of a finite automaton”, Intelligent systems. Theory and applications, 20:3 (2016), 101-102 (in Russian).Search in Google Scholar

[29] S. S. Morozov, “On the modeling complexity of regular events by automata”, Intelligent systems. Theory and applications, 20:3 (2016), 112-114 (in Russian).Search in Google Scholar

[30] S. B. Rodin, “Irredundant encoding of automata”, Intelligent systems. Theory and applications, 20:3 (2016), 115-119 (in Russian).Search in Google Scholar

[31] A. A. Chasovskikh, “The equation of closure opetators in the class of linear automaton functions”, Intelligent systems. Theory and applications, 20:3 (2016), 120-125 (in Russian).Search in Google Scholar

[32] A. M. Mirnov, “Main concepts of a theory of probabilistic automata (part 2)”, Intelligent systems. Theory and applications, 20:2 (2016), 283-330 (in Russian).Search in Google Scholar

[33] S. B. Rodin, “On relationship between linear realized automata and automata with maximal variability with respect to state encoding”, Intelligent systems. Theory and applications, 20:2 (2016), 337-348 (in Russian).Search in Google Scholar

[34] D. I. Vasiliev, “On the stabilization of a dynamic system associated with automaton modeling of migration processes”, Intelligent systems. Theory and applications, 19:3 (2015), 27-37 (in Russian).Search in Google Scholar