2016/05/05 by Mathilde Noual, Noual, Mathilde
Biochemistry, Genetics and Molecular Biology · Computer Science · #Cellular Automata and Applications #DNA and Biological Computing #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Gene Regulatory Network Analysis
paper · pdf · doi:10.48550/arxiv.1605.01505
openalex publication_date 2016/05/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
It is known that there are no more Lyndon words of length n than there are periodic necklaces of same length. This paper considers a similar problem where, additionally, the necklaces must be without some forbidden factors. This problem relates to a different context, concerned with the behaviours of particular discrete dynamical systems, namely, Boolean automata networks. A formal argument supporting the following idea is provided: addition of cycle intersections in network structures causes exponential reduction of the networks' number of attractors.