TY - GEN

T1 - The synergy of finite state machines

AU - Afek, Yehuda

AU - Emek, Yuval

AU - Kolikant, Noa

N1 - Publisher Copyright:
© Yehuda Afek, Yuval Emek, and Noa Kolikant.

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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’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.

AB - 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’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.

KW - Beeping communication scheme

KW - Distributed network computability

KW - Finite state machines

KW - Stone-age model

UR - http://www.scopus.com/inward/record.url?scp=85068063827&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.OPODIS.2018.22

DO - 10.4230/LIPIcs.OPODIS.2018.22

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85068063827

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 22nd International Conference on Principles of Distributed Systems, OPODIS 2018

A2 - Cao, Jiannong

A2 - Ellen, Faith

A2 - Rodrigues, Luis

A2 - Ferreira, Bernardo

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 22nd International Conference on Principles of Distributed Systems, OPODIS 2018

Y2 - 17 December 2018 through 19 December 2018

ER -