Non-sequential recursive pair substitution: some rigorous results
From MaRDI portal
Abstract: We present rigorous results on some open questions on NSRPS, non sequential recursive pairs substitution method (see Grassberger in cite{G}). In particular, starting from the action of NSRPS on finite strings we define a corresponding natural action on measures and we prove that the iterated measure becomes asymptotically Markov. This certify the effectiveness of NSRPS as a tool for data compression and entropy estimation.
Recommendations
- Non-sequential recursive pair substitutions and numerical entropy estimates in symbolic dynamical systems
- Relative entropy via non-sequential recursive pair substitution
- Entropy and data compression schemes
- Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression
- Entropy analysis of substitutive sequences revisited
Cites work
- A universal algorithm for sequential data compression
- Analysis of symbolic sequences using the Jensen-Shannon divergence
- Artificial sequences and complexity measures
- Compression of individual sequences via variable-rate coding
- Data compression and learning in time sequences analysis
- Entropy estimation of symbol sequences
- scientific article; zbMATH DE number 52519 (Why is no real title available?)
- scientific article; zbMATH DE number 1042219 (Why is no real title available?)
- scientific article; zbMATH DE number 1145169 (Why is no real title available?)
- scientific article; zbMATH DE number 918233 (Why is no real title available?)
- Information and dynamical systems: A concrete measurement on sporadic dynamics
- On grammars, complexity, and information measures of biological macromolecules
- On the syntactic structure of protein sequences and the concept of grammar complexity
Cited in
(5)- Non-recursive trade-offs are ``almost everywhere
- Relative entropy via non-sequential recursive pair substitution
- scientific article; zbMATH DE number 4212043 (Why is no real title available?)
- RECURRENT DOUBLE SEQUENCES THAT CAN BE PRODUCED BY CONTEXT-FREE SUBSTITUTIONS
- Non-sequential recursive pair substitutions and numerical entropy estimates in symbolic dynamical systems
This page was built for publication: Non-sequential recursive pair substitution: some rigorous results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5239313)