License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2018.22
URN: urn:nbn:de:0030-drops-100825
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/10082/
Go to the corresponding LIPIcs Volume Portal

Afek, Yehuda ; Emek, Yuval ; Kolikant, Noa

The Synergy of Finite State Machines

pdf-format:
LIPIcs-OPODIS-2018-22.pdf (0.5 MB)

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'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.

BibTeX - Entry

@InProceedings{afek_et_al:LIPIcs:2018:10082,
  author =	{Yehuda Afek and Yuval Emek and Noa Kolikant},
  title =	{{The Synergy of Finite State Machines}},
  booktitle =	{22nd International Conference on Principles of Distributed  Systems (OPODIS 2018)},
  pages =	{22:1--22:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-098-9},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{125},
  editor =	{Jiannong Cao and Faith Ellen and Luis Rodrigues and Bernardo Ferreira},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/10082},
  URN =		{urn:nbn:de:0030-drops-100825},
  doi =		{10.4230/LIPIcs.OPODIS.2018.22},
  annote =	{Keywords: finite state machines, stone-age model, beeping communication scheme, distributed network computability}
}

Keywords: finite state machines, stone-age model, beeping communication scheme, distributed network computability
Collection: 22nd International Conference on Principles of Distributed Systems (OPODIS 2018)
Issue Date: 2018
Date of publication: 15.01.2019

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI