On the Link between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems

Jacques M. Bahi, Jean-François Couchot, Christophe Guyeux, Adrien Richard. On the Link between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems. In Olaf Owe, Martin Steffen, Jan Arne Telle, editors, Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings. Volume 6914 of Lecture Notes in Computer Science, pages 126-137, Springer, 2011. [doi]

@inproceedings{BahiCGR11,
  title = {On the Link between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems},
  author = {Jacques M. Bahi and Jean-François Couchot and Christophe Guyeux and Adrien Richard},
  year = {2011},
  doi = {10.1007/978-3-642-22953-4_11},
  url = {http://dx.doi.org/10.1007/978-3-642-22953-4_11},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BahiCGR11},
  cites = {0},
  citedby = {0},
  pages = {126-137},
  booktitle = {Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings},
  editor = {Olaf Owe and Martin Steffen and Jan Arne Telle},
  volume = {6914},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-22952-7},
}