A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
An Overview of Recent Solutions to and Lower Bounds for the Firing Synchronization Problem
[article]
2017
arXiv
pre-print
Complex systems in a wide variety of areas such as biological modeling, image processing, and language recognition can be modeled using networks of very simple machines called finite automata. Connecting subsystems modeled using finite automata into a network allows for more computational power. One such network, called a cellular automaton, consists of an n-dimensional array for n > 1 with a single finite automaton located at each point of the array. One of the oldest problems associated with
arXiv:1701.01045v1
fatcat:dit5tqmhk5fcbksnoj5j2uh5ri