Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnyi Analiz i Issledovanie Operatsii, 1996, Volume 3, Issue 1, Pages 52–56 (Mi da427)  
This article is cited in 10 scientific papers (total in 10 papers)

A lower bound on complexity for schemes of the concatenation of words

Yu. V. Merekin

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Full-text PDF (520 kB) Citations (10)
Received: 05.01.1996
Bibliographic databases:
UDC: 519.714
Language: Russian
Citation: Yu. V. Merekin, “A lower bound on complexity for schemes of the concatenation of words”, Diskretn. Anal. Issled. Oper., 3:1 (1996), 52–56
Citation in format AMSBIB
\Bibitem{Mer96}
\by Yu.~V.~Merekin
\paper A~lower bound on complexity for schemes of the concatenation of words
\jour Diskretn. Anal. Issled. Oper.
\yr 1996
\vol 3
\issue 1
\pages 52--56
\mathnet{http://mi.mathnet.ru/da427}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1444681}
\zmath{https://zbmath.org/?q=an:0945.68527}
Linking options:
  • https://www.mathnet.ru/eng/da427
  • https://www.mathnet.ru/eng/da/v3/i1/p52
    • This publication is cited in the following 10 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:357
    Full-text PDF :155
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024