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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 1997, Volume 9, Issue 2, Pages 74–78
DOI: https://doi.org/10.4213/dm474 (Mi dm474) 		 
On the completeness of systems of finite automata

V. A. Orlov
Full-text PDF (552 kB)
DOI: https://doi.org/10.4213/dm474
Abstract: For an arbitrary alphabet $A$, we construct a recursive set of bases of automata with a single output and no more than two inputs, with algorithmically unsolvable completeness problem. The result is final, because the bases of automata with a single input and single output are incomplete.
Received: 15.06.1994
Bibliographic databases:
UDC: 519.10
Language: Russian
Citation: V. A. Orlov, “On the completeness of systems of finite automata”, Diskr. Mat., 9:2 (1997), 74–78; Discrete Math. Appl., 7:3 (1997), 273–277
Citation in format AMSBIB
\Bibitem{Orl97}
\by V.~A.~Orlov
\paper On the completeness of systems of finite automata
\jour Diskr. Mat.
\yr 1997
\vol 9
\issue 2
\pages 74--78
\mathnet{http://mi.mathnet.ru/dm474}
\crossref{https://doi.org/10.4213/dm474}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1468072}
\zmath{https://zbmath.org/?q=an:0966.68099}
\transl
\jour Discrete Math. Appl.
\yr 1997
\vol 7
\issue 3
\pages 273--277
Linking options:
  • https://www.mathnet.ru/eng/dm474
  • https://doi.org/10.4213/dm474
  • https://www.mathnet.ru/eng/dm/v9/i2/p74
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:435
    Full-text PDF :300
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024