Sets of K-independent strings

DOI10.1142/S0129054110007271zbMATH Open1192.68384OpenAlexW2012588249WikidataQ57349644 ScholiaQ57349644MaRDI QIDQ3569274FDOQ3569274

Authors: Yen-Wu Ti, Ching-Lueh Chang, Yuh-Dauh Lyuu, A. Shen 

Publication date: 18 June 2010

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054110007271

Recommendations

• Counting dependent and independent strings
• On generating independent random strings
• Generating Kolmogorov random strings from sources with limited independence
• Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence
• Algorithmically Independent Sequences

zbMATH Keywords

Kolmogorov complexity\(k\)-independent string

Mathematics Subject Classification ID

Semisimple Lie groups and their representations (22E46) Differential geometry of symmetric spaces (53C35) Noncompact Lie groups of transformations (57S20) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cited In (8)

• Algorithmically independent sequences
• Kolmogorov complexity as a language
• Counting dependent and independent strings
• On generating independent random strings
• Symmetry of Information: A Closer Look
• Systems of strings with high mutual complexity
• Counting Dependent and Independent Strings
• Algorithmically Independent Sequences

This page was built for publication: Sets of \(K\)-independent strings

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