On the Complexity of Deciding Avoidability of Sets of Partial Words (Q3637218): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-02737-6_9
+Normal rank
@@ Property / OpenAlex ID @@
+W1884971315
@@ Property / OpenAlex ID: W1884971315 / 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 @@
+UNAVOIDABLE SETS OF CONSTANT LENGTH
@@ Property / cites work: UNAVOIDABLE SETS OF CONSTANT LENGTH / 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 @@
+Efficient string matching
@@ Property / cites work: Efficient string matching / rank @@
+Normal rank
@@ Property / cites work @@
+Testing avoidability on sets of partial words is hard
+Normal rank
@@ Property / cites work @@
+Repetition-free words
@@ Property / cites work: Repetition-free words / 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 @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank