Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




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

Avtomatika i Telemekhanika, 1979, Issue 4, Pages 94–100 (Mi at9426)  
Automata

On connectivity of a graph representing an automaton of many states

E. B. Frolov

Moscow
Full-text PDF (1098 kB)
Abstract: A connectivity criterion is proposed for a transition graph of a finite automation. The criterion features relatively low labor consumption and applicable to analysis of finite automata with many states when conventional connectivity criteria are inapplicable.

Received: 15.05.1978
Bibliographic databases:
Document Type: Article
UDC: 53.072:51
Language: Russian
Citation: E. B. Frolov, “On connectivity of a graph representing an automaton of many states”, Avtomat. i Telemekh., 1979, no. 4, 94–100; Autom. Remote Control, 40:4 (1979), 558–563
Citation in format AMSBIB
\Bibitem{Fro79}
\by E.~B.~Frolov
\paper On connectivity of a graph representing an automaton of many states
\jour Avtomat. i Telemekh.
\yr 1979
\issue 4
\pages 94--100
\mathnet{http://mi.mathnet.ru/at9426}
\zmath{https://zbmath.org/?q=an:0418.68057}
\transl
\jour Autom. Remote Control
\yr 1979
\vol 40
\issue 4
\pages 558--563
Linking options:
  • https://www.mathnet.ru/eng/at9426
  • https://www.mathnet.ru/eng/at/y1979/i4/p94
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:98
    Full-text PDF :54
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024