Finitely Generated Semiautomatic Groups (Q3188266): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-40189-8_29
+Normal rank
@@ Property / OpenAlex ID @@
+W2485001503
@@ Property / OpenAlex ID: W2485001503 / rank @@
+Normal rank
@@ Property / cites work @@
+On Automatic Transitive Graphs
@@ Property / cites work: On Automatic Transitive Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic functions, linear time and learning
@@ Property / cites work: Automatic functions, linear time and learning / rank @@
+Normal rank
@@ Property / cites work @@
+Q3312199
@@ Property / cites work: Q3312199 / rank @@
+Normal rank
@@ Property / cites work @@
+Semiautomatic Structures
@@ Property / cites work: Semiautomatic Structures / rank @@
+Normal rank
@@ Property / cites work @@
+From automatic structures to automatic groups.
@@ Property / cites work: From automatic structures to automatic groups. / rank @@
+Normal rank
@@ Property / cites work @@
+Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic
+Normal rank
@@ Property / cites work @@
+Describing Groups
@@ Property / cites work: Describing Groups / rank @@
+Normal rank
@@ Property / cites work @@
+FA-presentable groups and rings
@@ Property / cites work: FA-presentable groups and rings / rank @@
+Normal rank
@@ Property / cites work @@
+The conjugacy problem in automaton groups is not solvable.
+Normal rank