Intelligent systems. Theory and applications
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


Intelligent systems. Theory and applications:
Year:
Volume:
Issue:
Page:
Find




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

Intelligent systems. Theory and applications, 2021, Volume 25, Issue 4, Pages 113–116 (Mi ista428)  
Part 2. Mathematics and Computer Science

Estimates of the time for the automaton to establish the properties of a graph to be a tree and a pseudo-tree

A. A. Demidova

Lomonosov Moscow State University
Full-text PDF (337 kB)
References:
PDF
HTML
Abstract: In this paper, we consider automata that traverse connected plane simple undirected graphs in order to establish their properties. An algorithm is presented, using which an automaton with two colors can determine whether the graph it traverses is a tree or a pseudotree, and upper bounds are determined for the number of steps that the automaton must make.
Keywords: Automata, graphs, trees, pseudotrees.
Document Type: Article
Language: Russian
Citation: A. A. Demidova, “Estimates of the time for the automaton to establish the properties of a graph to be a tree and a pseudo-tree”, Intelligent systems. Theory and applications, 25:4 (2021), 113–116
Citation in format AMSBIB
\Bibitem{Dem21}
\by A.~A.~Demidova
\paper Estimates of the time for the automaton to establish the properties of a graph to be a tree and a pseudo-tree
\jour Intelligent systems. Theory and applications
\yr 2021
\vol 25
\issue 4
\pages 113--116
\mathnet{http://mi.mathnet.ru/ista428}
Linking options:
  • https://www.mathnet.ru/eng/ista428
  • https://www.mathnet.ru/eng/ista/v25/i4/p113
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Intelligent systems. Theory and applications
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024