Counting Dependent and Independent Strings

DOI10.3233/FI-2014-1027MaRDI QIDQ5415292zbMATH OpenOpenAlexFDO

Authors Marius Zimand

Publication date 12 May 2014

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2014-1027

zbMATH Keywords

\(\alpha\)-dependencyKolmogorov complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Counting dependent and independent strings
• Counting distinct strings
• Sets of K-independent strings
• Counting strings in Dyck paths
• Counting suffix arrays and strings
• Counting certain binary strings
• scientific article; zbMATH DE number 3974323
• Independence and PI polynomials for few strings
• Some generalizations on counting binary strings

Cited in

(2)

• Counting distinct strings
• scientific article; zbMATH DE number 3974323 (Why is no real title available?)

This page was built for publication: Counting Dependent and Independent Strings

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