Elementary cellular automaton Rule 110 explained as a block substitution system. Rule 110 as a block substitution system (Q985741): Difference between revisions

@@ Property / author @@
+Juan Carlos Seck-Tuoh-Mora
@@ Property / author: Juan Carlos Seck-Tuoh-Mora / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00607-010-0096-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2046001965
@@ Property / OpenAlex ID: W2046001965 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3750126
@@ Property / cites work: Q3750126 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5321501
@@ Property / cites work: Q5321501 / rank @@
+Normal rank
@@ Property / cites work @@
+P-completeness of Cellular Automaton Rule 110
@@ Property / cites work: P-completeness of Cellular Automaton Rule 110 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3521760
@@ Property / cites work: Q3521760 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3150942
@@ Property / cites work: Q3150942 / rank @@
+Normal rank
@@ Property / cites work @@
+Representation of reversible cellular automata with block permutations
+Normal rank