Graph groups are biautomatic (Q1331906): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0022-4049(94)90015-9
+Normal rank
@@ Property / OpenAlex ID @@
+W1972761586
@@ Property / OpenAlex ID: W1972761586 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4012140
@@ Property / cites work: Q4012140 / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic groups and amalgams
@@ Property / cites work: Automatic groups and amalgams / rank @@
+Normal rank
@@ Property / cites work @@
+Q4003861
@@ Property / cites work: Q4003861 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial problems of commutation and rearrangements
+Normal rank
@@ Property / cites work @@
+Subgroups of graph groups
@@ Property / cites work: Subgroups of graph groups / rank @@
+Normal rank
@@ Property / cites work @@
+Small cancellation theory and automatic groups
@@ Property / cites work: Small cancellation theory and automatic groups / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and geometry for graph products of groups
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4145882
@@ Property / cites work: Q4145882 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5513066
@@ Property / cites work: Q5513066 / rank @@
+Normal rank
@@ Property / cites work @@
+On theories with a combinatorial definition of 'equivalence'
+Normal rank
@@ Property / cites work @@
+Surface Subgroups of Graph Groups
@@ Property / cites work: Surface Subgroups of Graph Groups / rank @@
+Normal rank
@@ Property / cites work @@
+Word problems and a homological finiteness condition for monoids
+Normal rank
@@ Property / cites work @@
+The word problem for free partially commutative groups
+Normal rank