Algorithmic Decidability of Engel’s Property for Automaton Groups (Q5740175): Difference between revisions

@@ Property / arXiv ID @@
+.01717
@@ Property / arXiv ID: 1512.01717 / rank @@
+Normal rank
@@ Property / cites work @@
+GROUP LAWS AND FREE SUBGROUPS IN TOPOLOGICAL GROUPS
+Normal rank
@@ Property / cites work @@
+Implementing Computations in Automaton (Semi)groups
+Normal rank
@@ Property / cites work @@
+Geometry and arithmetic of verbal dynamical systems on simple groups (with an appendix by Nathan Jones)
+Normal rank
@@ Property / cites work @@
+Q4788594
@@ Property / cites work: Q4788594 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4668873
@@ Property / cites work: Q4668873 / rank @@
+Normal rank
@@ Property / cites work @@
+Iterated identities and iterational depth of groups
+Normal rank
@@ Property / cites work @@
+THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE
+Normal rank
@@ Property / cites work @@
+On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata
+Normal rank
@@ Property / cites work @@
+The Engel elements of a soluble group
@@ Property / cites work: The Engel elements of a soluble group / rank @@
+Normal rank
@@ Property / cites work @@
+On locally finite varieties with undecidable equational theory.
+Normal rank
@@ Property / cites work @@
+The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable
+Normal rank
@@ Property / cites work @@
+Q4255242
@@ Property / cites work: Q4255242 / rank @@
+Normal rank
@@ Property / cites work @@
+On compact Engel groups.
@@ Property / cites work: On compact Engel groups. / rank @@
+Normal rank