Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




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

Problemy Peredachi Informatsii, 1982, Volume 18, Issue 1, Pages 104–107 (Mi ppi1219)  
Сorrespondence

Attractive States of Deterministic Automata Systems

V. N. Basmanov
Full-text PDF (438 kB)
Abstract: We prove that the set of attractive states of a deterministic automata system can be continual.
Received: 18.08.1980
Bibliographic databases:
Document Type: Article
UDC: 621.391.1:62-507
Language: Russian
Citation: V. N. Basmanov, “Attractive States of Deterministic Automata Systems”, Probl. Peredachi Inf., 18:1 (1982), 104–107
Citation in format AMSBIB
\Bibitem{Bas82}
\by V.~N.~Basmanov
\paper Attractive States of Deterministic Automata Systems
\jour Probl. Peredachi Inf.
\yr 1982
\vol 18
\issue 1
\pages 104--107
\mathnet{http://mi.mathnet.ru/ppi1219}
\zmath{https://zbmath.org/?q=an:0496.68041}
Linking options:
  • https://www.mathnet.ru/eng/ppi1219
  • https://www.mathnet.ru/eng/ppi/v18/i1/p104
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:145
    Full-text PDF :69
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024