Sequence entropy and the maximal pattern complexity of infinite words

By Teturo Kamae, Luca Q. Zamboni. Ergodic Theory and Dynamical Systems, 2002

87 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Maximal pattern complexity for discrete systems (2002, methodology): “This notion of complexity is intimately related to sequence entropy (see [6]).”
Non-commercial Research and Educational Use including without Limitation Use in Instruction at Your Institution, Sending It to Specific Colleagues That You Know, and Providing a Copy to Your Institution's Administrator. All Other Uses, Reproduction and Distribution, including without Limitation Comm (2005, unknown): “From these couplings accurate relative solute geometries and information about solute conformational change can be obtained.”
Local entropy theory (2009, background): “Maximal pattern entropy In their work [67], Kamae and Zamboni introduced a variation of the complexity function which they call maximal pattern complexity.”
Combinatorial lemmas and applications to dynamics (2009, background): “is pattern Sturmian [20,21] if p∗(n)= 2n for each n ∈N.”