Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"maximal pattern Complexity"”.

  1. Some Results in Maximal Pattern Complexity

    … , Kamae and Zamboni combined the ideas of block complexity and topological sequence entropy to define the maximal pattern complexity, 𝑝∗𝑛 (𝑥). They defined an aperiodic sequence 𝑥 over two letters as pattern Sturmian if it had the lowest possible maximal pattern complexity, 2𝑛. Later, Kamae and …

    denver Repository record for Some Results in Maximal Pattern Complexity (opens in a new tab)