Abstract
In this paper, we study product-free subsets of the free semigroup over a finite alphabet A. We prove that the maximum density of a product-free subset of the free semigroup over A, with respect to the natural measure that assigns a weight of |A|−n to each word of length n, is precisely 1∕2.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
