See Simplicity bias in finite-state transducers
The graph structure of a deterministic automaton chosen at random
See Random deterministic automata
On the entropy of a hidden Markov process
On Grammars, Complexity, and Information Measures of Biological Macromolecules
Activities and Sensitivities in Boolean Network Models
Complexity theory – Descriptional complexity
–>Entropy and complexity of finite sequences as fluctuating quantities
–>Lempel-Ziv complexity analysis of one dimensional cellular automata
Coding Theorems for Individual Sequences . His complexity measure looks very similar to the topological entropy defined here.
http://arxiv.org/pdf/1512.04270v2.pdf . -machines reconstruction or computational mechanics, is a powerful tool in the analysis of complexity, which has been used in a wealth of different theoretical and practical situations.
Entropy of Hidden Markov Processes and Connections to Dynamical Systems: Papers from the Banff International Research Station Workshop – Codes, Systems, and Graphical Models – An Introduction to Symbolic Dynamics and Coding – Fundamentals of Codes, Graphs, and Iterative Decoding – Topological Entropy and Equivalence of Dynamical Systems – Symbolic Dynamics and Its Applications – Ergodic Theory and Topological Dynamics of Group Actions on Homogeneous Spaces – Substitutions in Dynamics, Arithmetics and Combinatorics – Combinatorics on Words – Fractal Geometry, Complex Dimensions and Zeta Functions – Dynamics and Randomness
Resolving Markov Chains Onto Bernoulli Shifts Via Positive Polynomials
Complexity of strings in the class of Markov sources – citations
On the entropy of a hidden Markov process – citations
lempel ziv complexity finite state channel lempel ziv complexity markov model
Check what these are! epsilon machines
Random matrix product
Capacity of finite state channels based on Lyapunov exponents of random matrices
Basic properties of the projective product with application to products of column-allowable