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 2, Pages 111–127 (Mi ista305)  
This article is cited in 2 scientific papers (total in 2 papers)

Part 3. Mathematical models

Automaton analysis of the properties of a graph to be a tree and a pseudo-tree

A. A. Demidova

Lomonosov Moscow State University
Full-text PDF (680 kB) Citations (2)
References:
PDF
HTML
Abstract: In this paper, we investigate the use of automata with erasable colors to determine the properties of connected planar undirected simple graphs. The following facts are proved: two erasable colors are enough for automata to determine whether the graph is a tree or a pseudo-tree.
Keywords: Automata, graphs, trees, pseudotrees.
Document Type: Article
Language: Russian
Citation: A. A. Demidova, “Automaton analysis of the properties of a graph to be a tree and a pseudo-tree”, Intelligent systems. Theory and applications, 25:2 (2021), 111–127
Citation in format AMSBIB
\Bibitem{Dem21}
\by A.~A.~Demidova
\paper Automaton analysis of the properties of a graph to be a tree and a pseudo-tree
\jour Intelligent systems. Theory and applications
\yr 2021
\vol 25
\issue 2
\pages 111--127
\mathnet{http://mi.mathnet.ru/ista305}
Linking options:
  • https://www.mathnet.ru/eng/ista305
  • https://www.mathnet.ru/eng/ista/v25/i2/p111
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Intelligent systems. Theory and applications
    Statistics & downloads:
    Abstract page:83
    Full-text PDF :53
    References:11
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024