Recognition of $$\boldsymbol{r}$$-Almost-Trees by Automata Traversing Graphs
Crossref DOI link: https://doi.org/10.3103/S0027132225700561
Published Online: 2026-01-27
Published Print: 2025-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Demidova, A. A.
Text and Data Mining valid from 2025-10-01
Version of Record valid from 2025-10-01
Article History
Received: 3 July 2024
Revised: 12 September 2025
Accepted: 15 October 2025
First Online: 27 January 2026
CONFLICT OF INTEREST
: The author of this work declares that she has no conflicts of interest.