Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnaya Matematika, 2016, Volume 28, Issue 3, Pages 97–110
DOI: https://doi.org/10.4213/dm1385 (Mi dm1385) 		 
This article is cited in 5 scientific papers (total in 5 papers)

On the probability of existence of substrings with the same structure in a random sequence

V. G. Mikhailov

Steklov Mathematical Institute of Russian Academy of Sciences
Full-text PDF (475 kB) Citations (5)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1385
Abstract: An asymptotic expression (with an explicit estimate of the remainder term) is obtained for the probability that in a finite sequence of polynomial trials controlled by a Markov chain there exist substrings having the same structure.
Keywords: polynomial scheme, Markov chain, structure of substring, equivalent substrings.
Funding agency Grant number
Russian Science Foundation 14-50-00005
This work was supported by the Russian Science Foundation under grant no. 14-50-00005.
Received: 15.06.2016
English version:
Discrete Mathematics and Applications, 2017, Volume 27, Issue 6, Pages 377–386
DOI: https://doi.org/10.1515/dma-2017-0038
Bibliographic databases:
Document Type: Article
UDC: 519.212+519.214
Language: Russian
Citation: V. G. Mikhailov, “On the probability of existence of substrings with the same structure in a random sequence”, Diskr. Mat., 28:3 (2016), 97–110; Discrete Math. Appl., 27:6 (2017), 377–386
Citation in format AMSBIB
\Bibitem{Mik16}
\by V.~G.~Mikhailov
\paper On the probability of existence of substrings with the same structure in a random sequence
\jour Diskr. Mat.
\yr 2016
\vol 28
\issue 3
\pages 97--110
\mathnet{http://mi.mathnet.ru/dm1385}
\crossref{https://doi.org/10.4213/dm1385}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3643048}
\elib{https://elibrary.ru/item.asp?id=27349818}
\transl
\jour Discrete Math. Appl.
\yr 2017
\vol 27
\issue 6
\pages 377--386
\crossref{https://doi.org/10.1515/dma-2017-0038}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000417791200004}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85038386604}
Linking options:
  • https://www.mathnet.ru/eng/dm1385
  • https://doi.org/10.4213/dm1385
  • https://www.mathnet.ru/eng/dm/v28/i3/p97
    • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:455
    Full-text PDF :125
    References:49
    First page:28
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024