"Finiteness problem for automaton groups over a binary alphabet is almost ..."

Andriy Russyev (2025)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2025.115478

access: closed

type: Journal Article

metadata version: 2025-08-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/Russyev25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Russyev25
Andriy Russyev:
Finiteness problem for automaton groups over a binary alphabet is almost decidable. Theor. Comput. Sci. 1052: 115478 (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.