Zobrazeno 1 - 10
of 206
pro vyhledávání: '"Martynova, Olga"'
Autor:
Martynova, Olga Alexandrovna
Publikováno v:
Известия Саратовского университета: Новая серия. Серия Философия. Психология. Педагогика, Vol 22, Iss 3, Pp 253-256 (2022)
Introduction. The article is devoted to the work of a Russian revolutionary, writer and Marxist theorist V. I. Zasulich. The subject of consideration is the historical and philosophical views of the thinker, which are analyzed on the basis of her wor
Externí odkaz:
https://doaj.org/article/2fda1eccadd44a28abb9ae126fc56146
Autor:
Martynova, Olga Alexandrovna
Publikováno v:
Известия Саратовского университета: Новая серия. Серия Философия. Психология. Педагогика, Vol 21, Iss 4, Pp 394-398 (2021)
The article is devoted to the work of the Russian revolutionary, writer and Marxist theorist V. I. Zasulich. The subject of consideration is the historical and philosophical views of the thinker, which are analyzed on the basis of her study devoted t
Externí odkaz:
https://doaj.org/article/86aff6660fa8488dac6de214ded03eed
Autor:
Martynova, Olga
The number of states and stack symbols needed to determinize nondeterministic input-driven pushdown automata (NIDPDA) working over a fixed alphabet is determined precisely. It is proved that in the worst case exactly 2^{n^2} states are needed to dete
Externí odkaz:
http://arxiv.org/abs/2404.10516
Autor:
Martynova, Olga
This paper proves the decidability of the emptiness problem for two models which recognize graphs: graph-walking automata, and tilings of graphs by star subgraphs (star automata). Furthermore, it is proved that the non-emptiness problem for graph-wal
Externí odkaz:
http://arxiv.org/abs/2212.02380
Autor:
Martynova, Olga, Okhotin, Alexander
The paper demonstrates the non-closure of the family of unambiguous linear languages (that is, those defined by unambiguous linear context-free grammars) under complementation. To be precise, a particular unambiguous linear grammar is presented, and
Externí odkaz:
http://arxiv.org/abs/2210.02329
Autor:
Martynova, Olga, Okhotin, Alexander
It is shown that, for every $n \geqslant 2$, the maximum length of the shortest string accepted by an $n$-state direction-determinate two-way finite automaton is exactly $\binom{n}{\lfloor\frac{n}{2}\rfloor}-1$ (direction-determinate automata are tho
Externí odkaz:
http://arxiv.org/abs/2210.00235
Autor:
Kabir, Muhammad Salman, Kurkin, Semen, Portnova, Galina, Martynova, Olga, Wang, Zhen, Hramov, Alexander
Publikováno v:
In Chaos, Solitons and Fractals: the interdisciplinary journal of Nonlinear Science, and Nonequilibrium and Complex Phenomena August 2024 185
Autor:
Mitiureva, Dina, Sysoeva, Olga, Proshina, Ekaterina, Portnova, Galina, Khayrullina, Guzal, Martynova, Olga
Publikováno v:
In Psychiatry Research: Neuroimaging August 2024 342
Autor:
Martynova, Olga, Okhotin, Alexander
Graph-walking automata (GWA) are a model for graph traversal using finite-state control: these automata move between the nodes of an input graph, following its edges. This paper investigates the effect of node-replacement graph homomorphisms on recog
Externí odkaz:
http://arxiv.org/abs/2111.10214
Autor:
Martynova, Olga
Publikováno v:
In Information and Computation January 2024 296