Automorphisms of shift spaces and the Higman--Thompson groups: the one-sided case
DOI10.19086/da.28243zbMath1497.20039arXiv2004.08478OpenAlexW3198948812MaRDI QIDQ3382250
Peter J. Cameron, Collin Bleak, Feyishayo Olukoya
Publication date: 20 September 2021
Published in: discrete Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.08478
dynamicsgenerating setstransducersHigman-Thompson groupsautomorphisms of the one-sided shiftcounting strongly synchronizing automatastrongly synchronizing automata
Formal languages and automata (68Q45) Simple groups (20E32) Enumeration in graph theory (05C30) Algebraic theory of languages and automata (68Q70) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Directed graphs (digraphs), tournaments (05C20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Presentations of generalisations of Thompson's group \(V\)
- The isomorphism problem for Higman-Thompson groups.
- Introductory notes on Richard Thompson's groups
- The infinite simple group \(V\) of Richard J. Thompson: presentations by permutations
- Isomorphisms of Brin-Higman-Thompson groups.
- Between primitive and 2-transitive: synchronization and its friends
- The homology of the Higman-Thompson groups
- Implementing Computations in Automaton (Semi)groups
- Automorphisms of one-sided subshifts of finite type
- Synchronizing Automata and the Černý Conjecture
- Marker automorphisms of the one-sided d-shift
- Conjugate subgroups and overgroups of Vn
- CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS
- Endomorphisms and automorphisms of the shift dynamical system