Testing avoidability on sets of partial words is hard (Q1006080): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2008.11.011
@@ Property / DOI: 10.1016/j.tcs.2008.11.011 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2008.11.011
+Normal rank
@@ Property / OpenAlex ID @@
+W2108981141
@@ Property / OpenAlex ID: W2108981141 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient string matching
@@ Property / cites work: Efficient string matching / rank @@
+Normal rank
@@ Property / cites work @@
+Partial words and a theorem of Fine and Wilf
@@ Property / cites work: Partial words and a theorem of Fine and Wilf / rank @@
+Normal rank
@@ Property / cites work @@
+ALGORITHMIC COMBINATORICS ON PARTIAL WORDS
@@ Property / cites work: ALGORITHMIC COMBINATORICS ON PARTIAL WORDS / rank @@
+Normal rank
@@ Property / cites work @@
+Two Element Unavoidable Sets of Partial Words
@@ Property / cites work: Two Element Unavoidable Sets of 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 @@
+On the Complexity of Computing the Capacity of Codes That Avoid Forbidden Difference Patterns
+Normal rank
@@ Property / cites work @@
+On extendibility of unavoidable sets
@@ Property / cites work: On extendibility of unavoidable sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+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 @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+DNA Computing
@@ Property / cites work: DNA Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4529547
@@ Property / cites work: Q4529547 / rank @@
+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 / DOI @@
+.1016/J.TCS.2008.11.011
@@ Property / DOI: 10.1016/J.TCS.2008.11.011 / rank @@
+Normal rank