|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
1. |
I. E. Naumov, E. V. Khvorostukhina, “P-hypergraph design with simulated annealing”, Intelligent systems. Theory and applications, 26:1 (2022), 107–111 |
2. |
V. A. Molchanov, E. V. Khvorostukhina, “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 |
|
2019 |
3. |
V. A. Molchanov, E. V. Khvorostukhina, “On problem of abstract definability of universal hypergraphic automata by input symbol semigroup”, Chebyshevskii Sb., 20:2 (2019), 259–272 |
1
|
|
2018 |
4. |
E. V. Khvorostukhina, V. A. Molchanov, “Universal hypergraphic automata representation by autonomous input symbols”, Model. Anal. Inform. Sist., 25:5 (2018), 561–571 |
2
|
|
2017 |
5. |
V. A. Molchanov, E. V. Khvorostukhina, “On problem of abstract characterization of universal hypergraphic automata”, Izv. Saratov Univ. Math. Mech. Inform., 17:2 (2017), 148–159 |
1
|
|
2009 |
6. |
E. V. Khvorostukhina, “On homomorphisms of endomorphism semigroups of hypergraphs”, Izv. Saratov Univ. Math. Mech. Inform., 9:3 (2009), 70–75 |
1
|
|
2008 |
7. |
E. V. Khvorostukhina, “On concrete characterization of universal hypergraphic automata”, Fundam. Prikl. Mat., 14:7 (2008), 223–231 ; J. Math. Sci., 164:2 (2010), 303–308 |
1
|
|
Organisations |
|
|
|
|