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 = Rn for some n ≥ 1. A language L is called primitive if L is its only root.

-- JeffreyShallit - 13 Jul 2011

Edit | Attach | Watch | Print version | History: r2 < r1 | Backlinks | Raw View | Raw edit | More topic actions
Topic revision: r2 - 2018-02-22 - JeffreyShallit
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2024 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback