Pages that link to "Item:Q3484360"

The following pages link to Elementariness of a finite set of words is co-NP-complete (Q3484360):

Displaying 10 items.

• The minimum substring cover problem (Q958306) (← links)
• A string-matching interpretation of the equation \(x^ m y^ n = z^ p\) (Q1190459) (← links)
• On the rank of the subsets of a free monoid (Q1193899) (← links)
• Deciding whether a finite set of words has rank at most two (Q1210296) (← links)
• Locally complete sets and finite decomposable codes (Q1605335) (← links)
• On the deficit of a finite set of words (Q1822632) (← links)
• Many aspects of defect theorems (Q1882912) (← links)
• Primitive sets of words (Q2662680) (← links)
• The Minimum Substring Cover Problem (Q5443381) (← links)
• Efficient Computation of 2-Covers of a String. (Q5874549) (← links)