On the fragmentary complexity of symbolic sequences

DOI10.1016/0304-3975(94)00261-GMaRDI QIDQ672375zbMATH OpenOpenAlexFDO

Authors Phil Diamond, Peter E. Kloeden, Victor Kozyakin, Alexei Pokrovskii

Publication date 28 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(94)00261-g

zbMATH Keywords

symbolic sequence

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Complexity of sequences and dynamical systems
• Measure-theoretic complexity of ergodic systems
• Compactness of symbolic sequences from chaotic systems
• Binary sequences. III: Complexity versus homogeneity and symmetry
• scientific article; zbMATH DE number 2219895

Cites work

• scientific article; zbMATH DE number 4174795 (Why is no real title available?)
• scientific article; zbMATH DE number 3714012 (Why is no real title available?)
• scientific article; zbMATH DE number 3775877 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 3419184 (Why is no real title available?)
• Chaotic phenomena in desynchronized systems and stability analysis
• Desynchronization of linear systems
• On the number of factors of Sturmian words
• Stability of phase-frequency desynchronized systems under a perturbation of the switching instants of the components

Cited in

(3)

• Feasibility of numerical modelling: Information aspect
• Decidability properties for fragments of CHR
• Compactness of symbolic sequences from chaotic systems

This page was built for publication: On the fragmentary complexity of symbolic sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672375)