Complexity of strings in the class of Markov sources
From MaRDI portal
Publication:3758710
DOI10.1109/TIT.1986.1057210zbMATH Open0621.94005OpenAlexW2148381206MaRDI QIDQ3758710FDOQ3758710
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
Recommendations
entropycomplexityMarkov sourcesfinite-state-machine defined sourcesminimum mean code-lengthShannon's self information
Cited In (18)
- Some results on tries with adaptive branching.
- Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence
- Relevant states and memory in Markov chain bootstrapping and simulation
- Distributions of pattern statistics in sparse Markov models
- Macroeconomic simulation comparison with a multivariate extension of the Markov information criterion
- Grammatical Inference: Algorithms and Applications
- Computation of exact probabilities associated with overlapping pattern occurrences
- Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity
- Alternative structure for computing APPs of the markov source
- Exponential bounds for the probability of wrong determination of the order of a Markov chain by using the EDC criterion
- The power of amnesia: Learning probabilistic automata with variable memory length
- Predictive stochastic complexity and model estimation for finite-state processes
- Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity
- On the Value of Multiple Read/Write Streams for Data Compression
- Entropic measures, Markov information sources and complexity
- On the complexity of learning strings and sequences
- Combinatorial Pattern Matching
- Variable length Markov chains
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)
