The synergy of finite state machines

Yehuda Afek, Yuval Emek, Noa Kolikant

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publication22nd International Conference on Principles of Distributed Systems, OPODIS 2018
EditorsJiannong Cao, Faith Ellen, Luis Rodrigues, Bernardo Ferreira
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770989
DOIs
StatePublished - 1 Jan 2019
Event22nd International Conference on Principles of Distributed Systems, OPODIS 2018 - Hong Kong, China
Duration: 17 Dec 201819 Dec 2018

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume125
ISSN (Print)1868-8969

Conference

Conference22nd International Conference on Principles of Distributed Systems, OPODIS 2018
Country/TerritoryChina
CityHong Kong
Period17/12/1819/12/18

Keywords

  • Beeping communication scheme
  • Distributed network computability
  • Finite state machines
  • Stone-age model

Fingerprint

Dive into the research topics of 'The synergy of finite state machines'. Together they form a unique fingerprint.

Cite this