Publications in Math-Net.Ru
-
P-hypergraph design with simulated annealing
Intelligent systems. Theory and applications, 26:1 (2022), 107–111
-
Elementary definability of the class of universal hypergraphic automata in the class of semigroups
Izv. Saratov Univ. Math. Mech. Inform., 22:3 (2022), 293–306
-
On problem of abstract definability of universal hypergraphic automata by input symbol semigroup
Chebyshevskii Sb., 20:2 (2019), 259–272
-
Universal hypergraphic automata representation by autonomous input symbols
Model. Anal. Inform. Sist., 25:5 (2018), 561–571
-
On problem of abstract characterization of universal hypergraphic automata
Izv. Saratov Univ. Math. Mech. Inform., 17:2 (2017), 148–159
-
On homomorphisms of endomorphism semigroups of hypergraphs
Izv. Saratov Univ. Math. Mech. Inform., 9:3 (2009), 70–75
-
On concrete characterization of universal hypergraphic automata
Fundam. Prikl. Mat., 14:7 (2008), 223–231
© , 2024