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, 2003, Volume 15, Issue 2, Pages 52–62
DOI: https://doi.org/10.4213/dm193 (Mi dm193) 		 
This article is cited in 4 scientific papers (total in 4 papers)

On the complexity of recurring sequences

S. S. Marchenkov
Full-text PDF (1280 kB) Citations (4)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm193
Abstract: We study recurring sequences over finite fields sets and the set $\mathbf N=\{0,1,2,\ldots\}$. The complexity of recurring sequences over finite sets is estimated as the complexity of computing on determinate linearly bounded automata. We introduce the notion of a branching recurring sequence. The complexity of branching recurring sequences over finite sets is estimated as the complexity of computing on non-determinate linearly bounded automata. Recurring sequences over the set $\mathbf N$ simulate computations on multi-tape Minsky machines. We ascertain undecidability of some problems concerning this type of recurring sequences.
This research was supported by the Russian Foundation for Basic Research, grant 00–01–00351.
Received: 12.02.2002
English version:
Discrete Mathematics and Applications, 2003, Volume 13, Issue 2, Pages 167–178
DOI: https://doi.org/10.1515/156939203322109122
Bibliographic databases:
UDC: 519.712
Language: Russian
Citation: S. S. Marchenkov, “On the complexity of recurring sequences”, Diskr. Mat., 15:2 (2003), 52–62; Discrete Math. Appl., 13:2 (2003), 167–178
Citation in format AMSBIB
\Bibitem{Mar03}
\by S.~S.~Marchenkov
\paper On the complexity of recurring sequences
\jour Diskr. Mat.
\yr 2003
\vol 15
\issue 2
\pages 52--62
\mathnet{http://mi.mathnet.ru/dm193}
\crossref{https://doi.org/10.4213/dm193}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2006675}
\zmath{https://zbmath.org/?q=an:1051.03031}
\transl
\jour Discrete Math. Appl.
\yr 2003
\vol 13
\issue 2
\pages 167--178
\crossref{https://doi.org/10.1515/156939203322109122}
Linking options:
  • https://www.mathnet.ru/eng/dm193
  • https://doi.org/10.4213/dm193
  • https://www.mathnet.ru/eng/dm/v15/i2/p52
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:515
    Full-text PDF :226
    References:48
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024