On the Link between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems
From MaRDI portal
Publication:3088276
DOI10.1007/978-3-642-22953-4_11zbMath1342.37044arXiv1112.1684OpenAlexW96532434MaRDI QIDQ3088276
Jean-François Couchot, Christophe Guyeux, Adrien Richard, Jacques M. Bahi
Publication date: 19 August 2011
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.1684
Applications of graph theory (05C90) Connectivity (05C40) Dynamical systems involving maps of trees and graphs (37E25)
Related Items
Gray codes generation algorithm and theoretical evaluation of random walks in \(N\)-cubes, Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations, Dynamics on binary relations over topological spaces
Cites Work