scientific article
From MaRDI portal
Publication:3977252
zbMath0799.68116MaRDI QIDQ3977252
Publication date: 25 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Measures of information, entropy (94A17)
Related Items (10)
Complex systems, complexity measures, grammars and model-inferring ⋮ A measure of statistical complexity based on predictive information with application to finite spin systems ⋮ Symbolic transfer entropy rate is equal to transfer entropy rate for bivariate finite-alphabet stationary ergodic Markov processes ⋮ A novel image encryption algorithm based on a 3D chaotic map ⋮ Quantifying local randomness in human DNA and RNA sequences using Erdös motifs ⋮ Approximation of chaotic systems in terms of Markovian processes ⋮ Measures of statistical complexity: why? ⋮ Regular Language Distance and Entropy ⋮ Image Encryption Scheme Based on Non-autonomous Chaotic Systems ⋮ On finding the complexity of an environment for the operation of a mobile object on a plane
This page was built for publication:
