Non-repetitive words relative to a rewriting system (Q908710): Difference between revisions

@@ Property / cites work @@
+Q3704906
@@ Property / cites work: Q3704906 / rank @@
+Normal rank
@@ Property / cites work @@
+An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
+Normal rank
@@ Property / cites work @@
+Almost all one-rule Thue systems have decidable word problems
+Normal rank
@@ Property / cites work @@
+Square-free words on partially commutative free monoids
+Normal rank
@@ Property / cites work @@
+Combinatorial problems of commutation and rearrangements
+Normal rank
@@ Property / cites work @@
+Q3736919
@@ Property / cites work: Q3736919 / rank @@
+Normal rank
@@ Property / cites work @@
+A Sequence Without Repeats on x, x -1 , y, y -1
@@ Property / cites work: A Sequence Without Repeats on x, x -1 , y, y -1 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4529547
@@ Property / cites work: Q4529547 / rank @@
+Normal rank
@@ Property / cites work @@
+Unending chess, symbolic dynamics and a problem in semi-groups
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(90)90045-j
+Normal rank
@@ Property / OpenAlex ID @@
+W2043361382
@@ Property / OpenAlex ID: W2043361382 / rank @@
+Normal rank