Algorithmic Decidability of Engel’s Property for Automaton Groups
From MaRDI portal
Publication:5740175
DOI10.1007/978-3-319-34171-2_3zbMath1477.20067arXiv1512.01717MaRDI QIDQ5740175
Publication date: 25 July 2016
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.01717
68Q45: Formal languages and automata
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
20F45: Engel conditions
20-08: Computational methods for problems pertaining to group theory
Related Items
Numerical upper bounds on growth of automaton groups, Algorithmic problems in Engel groups and cryptographic applications, A note on Engel elements in the first Grigorchuk group, A New Hierarchy for Automaton Semigroups, An automaton group with undecidable order and Engel problems, Bounded Engel elements in groups satisfying an identity, Engel elements in weakly branch groups, Engel elements in some fractal groups
Uses Software
Cites Work
- Geometry and arithmetic of verbal dynamical systems on simple groups (with an appendix by Nathan Jones)
- The Engel elements of a soluble group
- Iterated identities and iterational depth of groups
- On compact Engel groups.
- On locally finite varieties with undecidable equational theory.
- On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata
- Implementing Computations in Automaton (Semi)groups
- The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable
- THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE
- GROUP LAWS AND FREE SUBGROUPS IN TOPOLOGICAL GROUPS
- Unnamed Item
- Unnamed Item
- Unnamed Item