Zobrazeno 1 - 10
of 1 108
pro vyhledávání: '"Okhotin, A."'
A new family of categorial grammars is proposed, defined by enriching basic categorial grammars with a conjunction operation. It is proved that the formalism obtained in this way has the same expressive power as conjunctive grammars, that is, context
Externí odkaz:
http://arxiv.org/abs/2405.16662
The communication matrix for two-way deterministic finite automata (2DFA) with $n$ states is defined for an automaton over a full alphabet of all $(2n+1)^n$ possible symbols: its rows and columns are indexed by strings, and the entry $(u, v)$ is $1$
Externí odkaz:
http://arxiv.org/abs/2312.05909
Autor:
Radionova, Maria, Okhotin, Alexander
Publikováno v:
EPTCS 388, 2023, pp. 110-124
This paper introduces sweeping permutation automata, which move over an input string in alternating left-to-right and right-to-left sweeps and have a bijective transition function. It is proved that these automata recognize the same family of languag
Externí odkaz:
http://arxiv.org/abs/2309.08723
Autor:
Okhotin, Andrey, Molchanov, Dmitry, Arkhipkin, Vladimir, Bartosh, Grigory, Ohanesian, Viktor, Alanov, Aibek, Vetrov, Dmitry
Denoising Diffusion Probabilistic Models (DDPMs) provide the foundation for the recent breakthroughs in generative modeling. Their Markovian structure makes it difficult to define DDPMs with distributions other than Gaussian or discrete. In this pape
Externí odkaz:
http://arxiv.org/abs/2302.05259
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
Publikováno v:
BMC Cardiovascular Disorders, Vol 24, Iss 1, Pp 1-9 (2024)
Abstract Background Atrial fibrillation is the most prevalent sustained cardiac arrhythmia. Electrical cardioversion, a well-established part of the rhythm control strategy, is probably underused in community settings. Here, we describe its use, safe
Externí odkaz:
https://doaj.org/article/8addc9ecaafa4710938f52e0d26acfa5
Autor:
Olkhovsky, Ilya, Okhotin, Alexander
Linear conjunctive grammars are a family of formal grammars with an explicit conjunction operation allowed in the rules, which is notable for its computational equivalence fo one-way real-time cellular automata, also known as trellis automata. This p
Externí odkaz:
http://arxiv.org/abs/2112.08014
Autor:
Tursun-zade, Rustam, Pushkina, Nika, Andreychenko, Anna, Denisova, Daria, Bunakova, Anna, Nazarova, Ekaterina, Komarov, Yuri, Arseniev, Andrei, Nefedov, Andrei, Kozlov, Vladimir, Timonin, Sergey, Okhotin, Artemiy, Barchuk, Anton
Publikováno v:
In Cancer Epidemiology December 2024 93
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