Permanent problem IDPPL 152
Formal languages
Find matching upper and lower bounds for the number of productions needed by a Chomsky-normal-form context-free grammar to separate equal-length words.
Find matching upper and lower bounds for the number of productions needed by a Chomsky-normal-form context-free grammar to separate equal-length words.
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.