Number of holes in unavoidable sets of partial words. I. (Q450546): Difference between revisions

@@ Property / cites work @@
+Algorithmic Combinatorics on Partial Words
@@ Property / cites work: Algorithmic Combinatorics on Partial Words / rank @@
+Normal rank
@@ Property / cites work @@
+Unavoidable sets of partial words
@@ Property / cites work: Unavoidable sets of partial words / rank @@
+Normal rank
@@ Property / cites work @@
+Q3018955
@@ Property / cites work: Q3018955 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three
+Normal rank
@@ Property / cites work @@
+UNAVOIDABLE SETS OF CONSTANT LENGTH
@@ Property / cites work: UNAVOIDABLE SETS OF CONSTANT LENGTH / rank @@
+Normal rank
@@ Property / cites work @@
+On extendibility of unavoidable sets
@@ Property / cites work: On extendibility of unavoidable sets / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal test on finite unavoidable sets of words
+Normal rank
@@ Property / cites work @@
+On regularity of context-free languages
@@ Property / cites work: On regularity of context-free languages / rank @@
+Normal rank
@@ Property / cites work @@
+Crucial words and the complexity of some extremal problems for sets of prohibited words
+Normal rank
@@ Property / cites work @@
+Unavoidable sets
@@ Property / cites work: Unavoidable sets / rank @@
+Normal rank
@@ Property / cites work @@
+A proof of Golomb's conjecture for the de Bruijn graph
+Normal rank
@@ Property / cites work @@
+Unavoidable languages, cuts and innocent sets of words
+Normal rank
@@ Property / cites work @@
+Inventories of unavoidable languages and the word-extension conjecture
+Normal rank
@@ Property / cites work @@
+Unavoidable sets of words of uniform length
@@ Property / cites work: Unavoidable sets of words of uniform length / rank @@
+Normal rank