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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find






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


Dokl. Akad. Nauk SSSR, 1981, Volume 256, Number 6, Pages 1326–1329 (Mi dan44261)  

MATHEMATICS

Two-way finite probabilistic automata and Turing machines with bounded tape complexity

R. V. Freivald

University of Latvia, Computing Center, Riga

Full text: PDF file (690 kB)

Bibliographic databases:
UDC: 51.01:518.5
Presented: А. Н. Колмогоров
Received: 03.10.1980

Citation: R. V. Freivald, “Two-way finite probabilistic automata and Turing machines with bounded tape complexity”, Dokl. Akad. Nauk SSSR, 256:6 (1981), 1326–1329

Citation in format AMSBIB
\Bibitem{Fre81}
\by R.~V.~Freivald
\paper Two-way finite probabilistic automata and Turing machines with bounded tape complexity
\jour Dokl. Akad. Nauk SSSR
\yr 1981
\vol 256
\issue 6
\pages 1326--1329
\mathnet{http://mi.mathnet.ru/dan44261}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=0606475}


Linking options:
  • http://mi.mathnet.ru/eng/dan44261
  • http://mi.mathnet.ru/eng/dan/v256/i6/p1326

    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
  • Number of views:
    This page:34
    Full text:25

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