On the subword complexity of m-free DOL languages (Q594602): Difference between revisions

@@ 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.1016/0020-0190(83)90050-9
+Normal rank
@@ Property / OpenAlex ID @@
+W1999191302
@@ Property / OpenAlex ID: W1999191302 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3860007
@@ Property / cites work: Q3860007 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3959451
@@ Property / cites work: Q3959451 / rank @@
+Normal rank
@@ Property / cites work @@
+On the subword complexity of square-free DOL languages
+Normal rank
@@ Property / cites work @@
+On the subword complexity of DOL languages with a constant distribution
+Normal rank
@@ Property / cites work @@
+On the size of the alphabet and the subword complexity of square-free DOL languages
+Normal rank
@@ Property / cites work @@
+Q3939259
@@ Property / cites work: Q3939259 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4140407
@@ Property / cites work: Q4140407 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3948608
@@ Property / cites work: Q3948608 / rank @@
+Normal rank