An improvement of subword complexity

DOI10.1515/ROSE.2011.011MaRDI QIDQ4923218zbMATHOpenAlexFDO

Authors E. E. Ivanko

Publication date 6 June 2013

Published in Random Operators and Stochastic Equations (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/rose.2011.011

zbMATH Keywords

Kolmogorov complexitycompressibilitysubword complexity

Mathematics Subject Classification ID

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

Cited in

(4)

• scientific article; zbMATH DE number 3892611 (Why is no real title available?)
• scientific article; zbMATH DE number 3954821 (Why is no real title available?)
• A speed-up for the commute between subword trees and DAWGs.
• scientific article; zbMATH DE number 3910468 (Why is no real title available?)

This page was built for publication: An improvement of subword complexity

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