Finite automata-models for the investigation of dynamical systems
From MaRDI portal
Publication:287156
DOI10.1016/S0020-0190(97)00110-5zbMath1337.68155OpenAlexW1975341317MaRDI QIDQ287156
Christian Schittenkopf, Wilfried Brauer, Gustavo Deco
Publication date: 26 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00110-5
Related Items (4)
Complexity of reachability problems for finite discrete dynamical systems ⋮ Reachability problems for sequential dynamical systems with threshold functions. ⋮ Characterizing turbulence in globally coupled maps with stochastic finite automata ⋮ ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS
Cites Work
- Unnamed Item
- Toward a quantitative theory of self-generated complexity
- On the abundance of aperiodic behaviour for maps on the interval
- Complex systems, complexity measures, grammars and model-inferring
- Exploring the intrinsic information loss in single-humped maps by refining multi-symbol partitions
- Statistical properties of chaos demonstrated in a class of one-dimensional maps
This page was built for publication: Finite automata-models for the investigation of dynamical systems
