Finitely Generated Semiautomatic Groups
From MaRDI portal
Publication:3188266
DOI10.1007/978-3-319-40189-8_29zbMath1476.20034OpenAlexW2485001503MaRDI QIDQ3188266
Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan
Publication date: 17 August 2016
Published in: Pursuit of the Universal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-40189-8_29
Generators, relations, and presentations of groups (20F05) Nilpotent groups (20F18) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items
Cites Work
- Unnamed Item
- FA-presentable groups and rings
- The conjugacy problem in automaton groups is not solvable.
- From automatic structures to automatic groups.
- Automatic functions, linear time and learning
- Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic
- On Automatic Transitive Graphs
- Describing Groups
- Semiautomatic Structures