On the fragmentary complexity of symbolic sequences

DOI10.1016/0304-3975(94)00261-GzbMath0873.68120OpenAlexW2064535428MaRDI QIDQ672375

Peter E. Kloeden, Phil Diamond, Victor S. Kozyakin, Alexei V. 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)

Related Items (1)

Feasibility of numerical modelling: Information aspect

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Chaotic phenomena in desynchronized systems and stability analysis

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