Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

An improvement of subword complexity

From MaRDI portal
Publication:4923218
Jump to:navigation, search

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

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)



Related Items (2)

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






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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4923218&oldid=19325080"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 07:55.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki