Ural State University of Economics

output

20112018

most citedExperimental Study of the Shortest Reset Word of Random Automata

8 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

7 papers

math.GN2018

Projective versions of the properties in the Scheepers Diagram

Alexander V. Osipov

Let $P$ be a topological property. A.V. Arhangel'skii calls $X$ projectively $P$ if every second countable continuous image of $X$ is $P$ . Lj.D.R. Ko$…

math.GN2018

A note on the Alster, Menger and D-type properties

Alexander V. Osipov, Selma Özçağ

In this paper we give new characterizations for almost Menger and weakly Menger spaces by neighborhood assignments and define a natural weakening of almost D-spaces and weakly D-sp…

math.GN2018★ 1 cited

A functional characterization of the Hurewicz property

Alexander V. Osipov

For a Tychonoff space $X$ , we denote by $C_{p} (X)$ the space of all real-valued continuous functions on $X$ with the topology of pointwise convergence. We give the functional charact…

math.GN2017

Classification of selectors for sequences of dense sets of Cp(X)

Alexander V. Osipov

We give the characteristics of selectors for sequences of dense sets of Cp(X) through the selection principles of a Tychonoff space X.

math.GN2017

On the different kinds of separability of the space of Borel functions

Alexander V. Osipov

In this paper we consider some properties of a space B(X) of Borel functions on a set of reals X, with pointwise topology, that are stronger than separability.

cond-mat.mes-hall2011

Magnetization and spin gap in two-dimensional organic ferrimagnet BIPNNBNO

V. E. Sinitsyn, I. G. Bostrem, A. S. Ovchinnikov +2

A magnetization process in two-dimensional ferrimagnet BIPNNBNO is analyzed. The compound consists of ferrimagnetic (1,1/2) chains coupled by two sorts of antiferromagnetic interac…

cs.FL2011★ 8 cited

Experimental Study of the Shortest Reset Word of Random Automata

Evgeny Skvortsov, Evgeny Tipikin

In this paper we describe an approach to finding the shortest reset word of a finite synchronizing automaton by using a SAT solver. We use this approach to perform an experimental…