ACL
2012
12 years 2 months ago
2012
The language MIX consists of all strings over the three-letter alphabet {a, b, c} that contain an equal number of occurrences of each letter. We prove Joshi’s (1985) conjecture ...
ITA
2008
14 years 13 days ago
2008
We prove two cases of a strong version of Dejean's conjecture involving extremal letter frequencies. The results are that there exist an infinite " 5 4 + " -free wor...