@inproceedings{fd178aa6cf124eb1b6b92cbe6a3e84ec,
title = "The synergy of finite state machines",
abstract = "What can be computed by a network of n randomized finite state machines communicating under the stone age model (Emek & Wattenhofer, PODC 2013)? The inherent linear upper bound on the total space of the network implies that its global computational power is not larger than that of a randomized linear space Turing machine, but is this tight? We answer this question affirmatively for bounded degree networks by introducing a stone age algorithm (operating under the most restrictive form of the model) that given a designated I/O node, constructs a tour in the network that enables the simulation of the Turing machine{\textquoteright}s tape. To construct the tour with high probability, we first show how to 2-hop color the network concurrently with building a spanning tree.",
keywords = "Beeping communication scheme, Distributed network computability, Finite state machines, Stone-age model",
author = "Yehuda Afek and Yuval Emek and Noa Kolikant",
note = "Publisher Copyright: {\textcopyright} Yehuda Afek, Yuval Emek, and Noa Kolikant.; 22nd International Conference on Principles of Distributed Systems, OPODIS 2018 ; Conference date: 17-12-2018 Through 19-12-2018",
year = "2019",
month = jan,
day = "1",
doi = "https://doi.org/10.4230/LIPIcs.OPODIS.2018.22",
language = "الإنجليزيّة",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
editor = "Jiannong Cao and Faith Ellen and Luis Rodrigues and Bernardo Ferreira",
booktitle = "22nd International Conference on Principles of Distributed Systems, OPODIS 2018",
}