Doklady Akademii Nauk SSSR
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

Doklady Akademii Nauk SSSR, 1969, Volume 187, Number 1, Pages 9–10 (Mi dan34723)  
MATHEMATICS

On two subclasses of Turing machines which can be reduced to finite automata

Yu. Ya. Breitbart, V. A. Kozmidiady
Full-text PDF (241 kB)
Presented: P. S. Novikov
Received: 23.01.1969
Bibliographic databases:
Document Type: Article
UDC: 517.11
Language: Russian
Citation: Yu. Ya. Breitbart, V. A. Kozmidiady, “On two subclasses of Turing machines which can be reduced to finite automata”, Dokl. Akad. Nauk SSSR, 187:1 (1969), 9–10
Citation in format AMSBIB
\Bibitem{BreKoz69}
\by Yu.~Ya.~Breitbart, V.~A.~Kozmidiady
\paper On two subclasses of Turing machines which can be reduced to finite automata
\jour Dokl. Akad. Nauk SSSR
\yr 1969
\vol 187
\issue 1
\pages 9--10
\mathnet{http://mi.mathnet.ru/dan34723}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=0272554}
\zmath{https://zbmath.org/?q=an:0193.33101}
Linking options:
  • https://www.mathnet.ru/eng/dan34723
  • https://www.mathnet.ru/eng/dan/v187/i1/p9
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024