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, 1964, Volume 155, Number 1, Pages 35–37 (Mi dan29249)  
This article is cited in 14 scientific papers (total in 14 papers)

MATHEMATICS

Algorithmic unsolvability of the problem of completeness recognition for finite automata

M. I. Kratko

Institute of Mathematics with Computing Center, Siberian Branch of USSR Academy of Sciences, Novosibirsk
Full-text PDF (488 kB) Citations (14)
Presented: A. I. Mal'tsev
Received: 19.10.1963
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: M. I. Kratko, “Algorithmic unsolvability of the problem of completeness recognition for finite automata”, Dokl. Akad. Nauk SSSR, 155:1 (1964), 35–37
Citation in format AMSBIB
\Bibitem{Kra64}
\by M.~I.~Kratko
\paper Algorithmic unsolvability of the problem of completeness recognition for finite automata
\jour Dokl. Akad. Nauk SSSR
\yr 1964
\vol 155
\issue 1
\pages 35--37
\mathnet{http://mi.mathnet.ru/dan29249}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=0160725}
\zmath{https://zbmath.org/?q=an:0171.27602}
Linking options:
  • https://www.mathnet.ru/eng/dan29249
  • https://www.mathnet.ru/eng/dan/v155/i1/p35
    • This publication is cited in the following 14 articles:
    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