Andriy Russyev
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Finiteness problem for automaton groups over a binary alphabet is almost decidable Theoretical Computer Science | 2025-09-16 | Paper |
| Conjugacy in finite state wreath powers of finite permutation groups | 2020-10-28 | Paper |
| scientific article; zbMATH DE number 5855532 (Why is no real title available?) | 2011-02-22 | Paper |
Research outcomes over time
This page was built for person: Andriy Russyev
