RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Subscription
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Izv. RAN. Ser. Mat.:
Year:
Volume:
Issue:
Page:
Find






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


Izv. Akad. Nauk SSSR Ser. Mat., 1984, Volume 48, Issue 3, Pages 520–568 (Mi izv1455)  

This article is cited in 2 scientific papers (total in 2 papers)

Recognition of an approximate occurrence of words on a Turing machine in real time

A. G. Ivanov


Abstract: A Turing machine is constructed which in real time solves the problem of the approximate identification of occurrences of words with respect to a number of familiar metrics. This problem is a generalization of the well-known problem of detecting occurrences of words, and differs from the latter in that it is not the question of the occurrence of one word in another which is under investigation, but rather the question of the existence of some subword of the second word which differs from the first word by no more than a specified quantity, with respect to the metric under consideration.
Bibliography: 9 titles.

Full text: PDF file (5922 kB)
References: PDF file   HTML file

English version:
Mathematics of the USSR-Izvestiya, 1985, 24:3, 479–522

Bibliographic databases:

UDC: 510.6
MSC: Primary 68C25; Secondary 68C40, 68G10
Received: 22.03.1983

Citation: A. G. Ivanov, “Recognition of an approximate occurrence of words on a Turing machine in real time”, Izv. Akad. Nauk SSSR Ser. Mat., 48:3 (1984), 520–568; Math. USSR-Izv., 24:3 (1985), 479–522

Citation in format AMSBIB
\Bibitem{Iva84}
\by A.~G.~Ivanov
\paper Recognition of an approximate occurrence of words on a~Turing machine in real time
\jour Izv. Akad. Nauk SSSR Ser. Mat.
\yr 1984
\vol 48
\issue 3
\pages 520--568
\mathnet{http://mi.mathnet.ru/izv1455}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=747250}
\zmath{https://zbmath.org/?q=an:0565.68081|0553.68047}
\transl
\jour Math. USSR-Izv.
\yr 1985
\vol 24
\issue 3
\pages 479--522
\crossref{https://doi.org/10.1070/IM1985v024n03ABEH001245}


Linking options:
  • http://mi.mathnet.ru/eng/izv1455
  • http://mi.mathnet.ru/eng/izv/v48/i3/p520

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Gad M. Landau, Uzi Vishkin, “Fast string matching with k differences”, Journal of Computer and System Sciences, 37:1 (1988), 63  crossref
    2. P. A. Pevzner, M. S. Waterman, “Multiple filtration and approximate pattern matching”, Algorithmica, 13:1-2 (1995), 135  crossref  mathscinet  zmath  isi
  • Известия Академии наук СССР. Серия математическая Izvestiya: Mathematics
    Number of views:
    This page:298
    Full text:88
    References:26
    First page:1

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019