@inproceedings{f4b4c24455b64809979ddb8fc217bbd7,

title = "Brief announcement: 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 [4] (a generalization of the beeping model's communication scheme)? 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? The reported reseach answers 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's tape. To construct the tour, it is first shown how to 2-hop color the network concurrently with building a spanning tree, with high probability.",

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, Yuvet almek, and Noa Kolikant;.; 31st International Symposium on Distributed Computing, DISC 2017 ; Conference date: 16-10-2017 Through 20-10-2017",

year = "2017",

month = oct,

day = "1",

doi = "10.4230/LIPIcs.DISC.2017.42",

language = "אנגלית",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

editor = "Richa, {Andrea W.}",

booktitle = "31st International Symposium on Distributed Computing, DISC 2017",

}