A Minimal Time Solution to the Firing Squad Synchronization Problem with Von Neumann Neighborhood of Extent 2

dc.contributor.advisor	Bruce Wade
dc.contributor.committeemember	Suzanne Boyd
dc.contributor.committeemember	Christine Cheng
dc.contributor.committeemember	Istvan Lauko
dc.contributor.committeemember	Jeb Willenbring
dc.creator	Boddie, Kathryn
dc.date.accessioned	2025-01-16T18:17:54Z
dc.date.available	2025-01-16T18:17:54Z
dc.date.issued	2019-08-01
dc.description.abstract	Cellular automata provide a simple environment in which to study global behaviors. One example of a problem that utilizes cellular automata is the Firing Squad Synchronization Problem, first proposed in 1957. This paper provides an overview of the standard Firing Squad Synchronization Problem and a commonly used technique in solving it. This paper also provides a statement of a new extension of the Standard Firing Squad Synchronization Problem to a different neighborhood definition - a Von Neumann neighborhood of extent 2. An 8 state 651 rule minimal time solution to the extended problem is described, presented and proven, along with Python code used in running simulations of the solution.
dc.identifier.uri	http://digital.library.wisc.edu/1793/86560
dc.relation.replaces	https://dc.uwm.edu/etd/2161
dc.title	A Minimal Time Solution to the Firing Squad Synchronization Problem with Von Neumann Neighborhood of Extent 2
dc.type	dissertation
thesis.degree.discipline	Mathematics
thesis.degree.grantor	University of Wisconsin-Milwaukee
thesis.degree.name	Doctor of Philosophy

Files

Now showing 1 - 1 of 1