On the fragmentary complexity of symbolic sequences

DOI10.1016/0304-3975(94)00261-GzbMATH Open0873.68120OpenAlexW2064535428MaRDI QIDQ672375FDOQ672375

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

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

zbMATH Keywords

symbolic sequence

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the number of factors of Sturmian words
• Title not available (Why is that?)
• Desynchronization of linear systems
• Stability of phase-frequency desynchronized systems under a perturbation of the switching instants of the components
• Chaotic phenomena in desynchronized systems and stability analysis
• Title not available (Why is that?)
• Title not available (Why is that?)

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)