Algorithmic Decidability of Engel’s Property for Automaton Groups

DOI10.1007/978-3-319-34171-2_3zbMath1477.20067arXiv1512.01717MaRDI QIDQ5740175

Laurent Bartholdi

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

Mathematics Subject Classification ID

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

Uses Software

• GAP
• FR