Permanent problem IDPPL 149
Formal languages
Determine the complexity of deciding whether every finite word occurs as a contiguous factor of a word in L*, for a finite list L.
Determine the complexity of deciding whether every finite word occurs as a contiguous factor of a word in L*, for a finite list L.
Personal cash offer stated in Shallit’s official talk. The live talks page records subsequent updates, including a paid solution to one omitted problem; confirm claim procedure with the sponsor before relying on the award.