|
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
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.
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
Linking options:
https://www.mathnet.ru/eng/ista305 https://www.mathnet.ru/eng/ista/v25/i2/p111
|
|