scientific article; zbMATH DE number 14854

MaRDI QIDQ3977252zbMATH OpenFDO

Authors Wentian Li

Publication date 25 June 1992

zbMATH Keywords

complexityentropyMarkov chainsregular languages

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Measures of information, entropy (94A17)

Cited in

(11)

• Complex systems, complexity measures, grammars and model-inferring
• Quantifying local randomness in human DNA and RNA sequences using Erdös motifs
• A measure of statistical complexity based on predictive information with application to finite spin systems
• Approximation of chaotic systems in terms of Markovian processes
• Measures of statistical complexity: why?
• On finding the complexity of an environment for the operation of a mobile object on a plane
• Image encryption scheme based on non-autonomous chaotic systems
• A novel image encryption algorithm based on a 3D chaotic map
• Regular language distance and entropy
• Symbolic transfer entropy rate is equal to transfer entropy rate for bivariate finite-alphabet stationary ergodic Markov processes
• On entropy and complexity of coherent states and Kähler geometry

This page was built for publication:

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