Advertisement

String-matching in real time: Some properties of the data structure

  • A. O. Slisenko
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 64)

Keywords

Binary Tree Binary String Input String Longe Repetition Random Access Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Матиясевич Ю.В. О распознавании в реальное время отнощения вхождения. Зап. наун. семинаров Ленингр.отд.Мат.ин-та АН СССР, 1971, 20, 104–114 (English transl. in J. Soviet Math., 1973, 1, N 1, 64–70).PubMedGoogle Scholar
  2. 2.
    Morris J., Pratt V. A linear pattern-matching algorithm. Tech. Rept.40, Computing Centre. Univ. of California, Berkeley, 1970.Google Scholar
  3. 3.
    Weiner P. Linear pattern mathing algorithm. IEEE 14th Annu.Symp. Switch. and Automata Theory, Iowa, 1973, 1–11.Google Scholar
  4. 4.
    Слисенко А.О. Распознавание предиката симметрии многоголовчатыми мащинами Тьюринга со входом. Тр.Мат.ин-та АН СССР, 1973, 129, 30–202. (English transl. in Proc.Steklov Inst.Math., 1973, 129, 25–208).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1978

Authors and Affiliations

  • A. O. Slisenko
    • 1
  1. 1.Leningrad Branch of Steklov Mathematical Institute (LOMI)LeningradUSSR

Personalised recommendations