THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE (Q5410736): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2295
@@ Property / arXiv ID: 1304.2295 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Limit Sets of Cellular Automata
@@ Property / cites work: On the Limit Sets of Cellular Automata / rank @@
+Normal rank
@@ Property / cites work @@
+On a question of Atiyah
@@ Property / cites work: On a question of Atiyah / rank @@
+Normal rank
@@ Property / cites work @@
+The lamplighter group as a group generated by a 2-state automaton, and its spectrum
+Normal rank
@@ Property / cites work @@
+The Nilpotency Problem of One-Dimensional Cellular Automata
+Normal rank
@@ Property / cites work @@
+Periodicity and Immortality in Reversible Computing
+Normal rank
@@ Property / cites work @@
+ON THE CAYLEY SEMIGROUP OF A FINITE APERIODIC SEMIGROUP
+Normal rank
@@ Property / cites work @@
+ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
+Normal rank
@@ Property / cites work @@
+The conjugacy problem in automaton groups is not solvable.
+Normal rank
@@ Property / cites work @@
+On exponential growth and uniformly exponential growth for groups.
+Normal rank