The subword complexity of an infinite word w is the function that sends each non-negative integer n to the number of distinct factors of length n. Note: this function does not count the number of distinct (scattered) subwords.

-- 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