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, 1968, Volume 180, Number 5, Pages 1053–1055 (Mi dan33913)  
CYBERNETICS AND THE REGULATION THEORY

Comparison of the complexities of realization of Boolean functions by automata and Turing machines

Yu. Ya. Breitbart

Moscow State (V. I. Lenin) Pedagogical Institute
Full-text PDF (391 kB)
Presented: P. S. Novikov
Received: 30.08.1967
Bibliographic databases:
Document Type: Article
UDC: 519.95
Language: Russian
Citation: Yu. Ya. Breitbart, “Comparison of the complexities of realization of Boolean functions by automata and Turing machines”, Dokl. Akad. Nauk SSSR, 180:5 (1968), 1053–1055
Citation in format AMSBIB
\Bibitem{Bre68}
\by Yu.~Ya.~Breitbart
\paper Comparison of the complexities of realization of Boolean functions by automata and Turing machines
\jour Dokl. Akad. Nauk SSSR
\yr 1968
\vol 180
\issue 5
\pages 1053--1055
\mathnet{http://mi.mathnet.ru/dan33913}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=0243942}
\zmath{https://zbmath.org/?q=an:0175.28203}
Linking options:
  • https://www.mathnet.ru/eng/dan33913
  • https://www.mathnet.ru/eng/dan/v180/i5/p1053
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:109
    Full-text PDF :51
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025