On the complexity of deciding avoidability of sets of partial words (Q606993): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2010.09.006
@@ Property / DOI: 10.1016/j.tcs.2010.09.006 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2010.09.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2129749965
@@ Property / OpenAlex ID: W2129749965 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient string matching
@@ Property / cites work: Efficient string matching / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Deciding Avoidability of Sets of Partial Words
+Normal rank
@@ 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 @@
+Testing avoidability on sets of partial words is hard
+Normal rank
@@ Property / cites work @@
+UNAVOIDABLE SETS OF CONSTANT LENGTH
@@ Property / cites work: UNAVOIDABLE SETS OF CONSTANT LENGTH / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank
@@ Property / cites work @@
+Simple deterministic wildcard matching
@@ Property / cites work: Simple deterministic wildcard matching / 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 @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994681
@@ Property / cites work: Q3994681 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4255576
@@ Property / cites work: Q4255576 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Repetition-free words
@@ Property / cites work: Repetition-free words / rank @@
+Normal rank
@@ Property / cites work @@
+Q4529547
@@ Property / cites work: Q4529547 / rank @@
+Normal rank
@@ Property / cites work @@
+A proof of Golomb's conjecture for the de Bruijn graph
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2010.09.006
@@ Property / DOI: 10.1016/J.TCS.2010.09.006 / rank @@
+Normal rank