Complexity of strings in the class of Markov sources

DOI10.1109/TIT.1986.1057210MaRDI QIDQ3758710zbMATH OpenOpenAlexFDO

Authors Jorma Rissanen

Publication date 1986

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.1986.1057210

zbMATH Keywords

entropycomplexityMarkov sourcesfinite-state-machine defined sourcesminimum mean code-lengthShannon's self information

Mathematics Subject Classification ID

Information theory (general) (94A15) Measures of information, entropy (94A17)

Recommendations

• Entropic measures, Markov information sources and complexity
• Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity
• Joint string complexity for Markov sources
• scientific article; zbMATH DE number 1747450
• Finite state complexity

Cited in

(20)

• Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity
• Predictive stochastic complexity and model estimation for finite-state processes
• Exponential bounds for the probability of wrong determination of the order of a Markov chain by using the EDC criterion
• An existence theorem in information theory
• Grammatical Inference: Algorithms and Applications
• Computation of exact probabilities associated with overlapping pattern occurrences
• Joint string complexity for Markov sources: small data matters
• Some results on tries with adaptive branching.
• Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence
• Alternative structure for computing APPs of the markov source
• Joint string complexity for Markov sources
• The power of amnesia: Learning probabilistic automata with variable memory length
• Macroeconomic simulation comparison with a multivariate extension of the Markov information criterion
• Variable length Markov chains
• Combinatorial Pattern Matching
• On the complexity of learning strings and sequences
• Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity
• Relevant states and memory in Markov chain bootstrapping and simulation
• Distributions of pattern statistics in sparse Markov models
• Entropic measures, Markov information sources and complexity

This page was built for publication: Complexity of strings in the class of Markov sources

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