Does every code have a unique primitive root? A set of words L is a code if every word has at most one factorization over L. For two languages L and R of words, we say that R is a root of L if L = Rⁿ for some n ≥ 1. A language L is called primitive if L is its only root.

-- JeffreyShallit - 13 Jul 2011