Recognition of $$\boldsymbol{r}$$-Almost-Trees by Automata Traversing Graphs
The subject of the paper is an automaton that traverses connected plane simple undirected graphs in order to determine whether they are $$r$$ -almost-trees. The paper provides an algorithm and time estimates for establishing this property, as well as a description of the automaton under consideration.
Authors
- A. A. Demidova
Institutions
- Lomonosov Moscow State University (RU)
Publication Details
- Journal
- Moscow University Mathematics Bulletin
- Published
- 2025-10-01
- DOI
- https://doi.org/10.3103/s0027132225700561
- Primary Topic
- semigroups and automata theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00