A criterion for checking the hypothesis about the existence of embeddings into a binary Markov chain
Prikladnaya Diskretnaya Matematika. Supplement, no. 9 (2016), pp. 9-10
Cet article a éte moissonné depuis la source Math-Net.Ru
A condition on the mutual asymptotic ratio of the length of a sequence and the volume of bit embeddings in it guaranteeing the existence of embeddings is given.
Mots-clés :
Markov chains
Keywords: embeddings into pseudorandom sequences, statistical criteria to distinguish hypotheses.
Keywords: embeddings into pseudorandom sequences, statistical criteria to distinguish hypotheses.
@article{PDMA_2016_9_a1,
author = {A. V. Volgin},
title = {A criterion for checking the hypothesis about the existence of embeddings into a~binary {Markov} chain},
journal = {Prikladnaya Diskretnaya Matematika. Supplement},
pages = {9--10},
year = {2016},
number = {9},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDMA_2016_9_a1/}
}
TY - JOUR AU - A. V. Volgin TI - A criterion for checking the hypothesis about the existence of embeddings into a binary Markov chain JO - Prikladnaya Diskretnaya Matematika. Supplement PY - 2016 SP - 9 EP - 10 IS - 9 UR - http://geodesic.mathdoc.fr/item/PDMA_2016_9_a1/ LA - ru ID - PDMA_2016_9_a1 ER -
A. V. Volgin. A criterion for checking the hypothesis about the existence of embeddings into a binary Markov chain. Prikladnaya Diskretnaya Matematika. Supplement, no. 9 (2016), pp. 9-10. http://geodesic.mathdoc.fr/item/PDMA_2016_9_a1/
[1] Shoitov A. M., “O vyyavlenii fakta zashumleniya konechnoi tsepi Markova s neizvestnoi matritsei perekhodnykh veroyatnostei”, Prikladnaya diskretnaya matematika. Prilozhenie, 2010, no. 3, 44–45