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, 1961, Volume 137, Number 4, Pages 804–806 (Mi dan24810)  
CYBERNETICS AND THE REGULATION THEORY

Algorithmic solvability of isomorphism problems for automata

Yu. I. Sorkin

Central Scientific-Research Institute of Integrated Automation
Full-text PDF (513 kB)
Presented: P. S. Novikov
Received: 31.10.1960
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: Yu. I. Sorkin, “Algorithmic solvability of isomorphism problems for automata”, Dokl. Akad. Nauk SSSR, 137:4 (1961), 804–806
Citation in format AMSBIB
\Bibitem{Sor61}
\by Yu.~I.~Sorkin
\paper Algorithmic solvability of isomorphism problems for automata
\jour Dokl. Akad. Nauk SSSR
\yr 1961
\vol 137
\issue 4
\pages 804--806
\mathnet{http://mi.mathnet.ru/dan24810}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=0141600}
\zmath{https://zbmath.org/?q=an:0112.00903}
Linking options:
  • https://www.mathnet.ru/eng/dan24810
  • https://www.mathnet.ru/eng/dan/v137/i4/p804
    • 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, 2025