RUS  ENG
Full version
JOURNALS // Informatika i Ee Primeneniya [Informatics and its Applications] // Archive

Inform. Primen., 2014 Volume 8, Issue 4, Pages 46–52 (Mi ia342)

This article is cited in 1 paper

Switching on of new bans in random sequences

A. A. Grushoab, N. A. Grushoa, E. E. Timoninaa

a Institute of Informatics Problems, Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
b Faculty of Computational Mathematics and Cybernetics, M. V. Lomonosov Moscow State University, 1-52 Leninskiye Gory, GSP-1, Moscow 119991, Russian Federation

Abstract: The problem of generating one probability measure on space of the infinite sequences on finite alphabets with $\sigma$-algebra generated by cylindrical sets out of another probability measure on this space is considered. A new probability measure is arranged to reduce the set of admissible trajectories of random sequences definitely. Inadmissibility of trajectories is defined in terms of specifications of the smallest bans. If a specification of the smallest bans is given, then the powers of support of projections of the new measure can be determined. It gives conditions to construct several sets of functions. These functions and projections of the initial measure define a set of measures on finite spaces which define the only probability measure on the space of infinite sequences.

Keywords: random sequences; bans of probability measures; generation of probability measures; statistical problems on random sequences.

Received: 31.10.2014

DOI: 10.14357/19922264140406



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026