An improvement of subword complexity

DOI10.1515/ROSE.2011.011zbMATH Open1267.68124OpenAlexW1977689315MaRDI QIDQ4923218FDOQ4923218

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

Recommendations

• scientific article; zbMATH DE number 3892611
• scientific article; zbMATH DE number 4085051
• scientific article; zbMATH DE number 3954821
• scientific article; zbMATH DE number 1992419
• scientific article; zbMATH DE number 1747450

zbMATH Keywords

Kolmogorov complexitycompressibilitysubword complexity

Mathematics Subject Classification ID

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

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A speed-up for the commute between subword trees and DAWGs.
• Title not available (Why is that?)

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)