Let w be an infinite word generated (by iteration) by a given morphism. Let p be any rational number. If there exists a word u such that up is a factor of w, then p is an exponent of w. The exponent of a morphism generating w is the supremum of the exponents of w. Given a morphism h and a rational number t, is it decidable whether t is an exponent of h?

This is known to be decidable in the case where the morphism is k-uniform for any integer k ≥ 2.

-- JeffreyShallit - 13 Jul 2011

Edit | Attach | Watch | Print version | History: r3 < r2 < r1 | Backlinks | Raw View | Raw edit | More topic actions
Topic revision: r3 - 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