Counter machines and distributed automata -- a story about exchanging space and time
type: Item
instance of: scholarly article
title: Counter machines and distributed automata -- a story about exchanging space and time
DOI: 10.1007/978-3-319-92675-9_2
author: Olivier Carton
author: Bruno Guillon
author: Fabian Reiter
publication date: 2018-08-10T00:00:00Z
full work available at URL: https://arxiv.org/abs/1804.03582
Mathematics Subject Classification ID: 68Q80
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 6916376
MaRDI profile type: Publication
OpenAlex ID: W3125648682
cites work: Regular Functions and Cost Register Automata
cites work: One-way bounded cellular automata
cites work: Indirect addressing and the time relationships of some models of sequential computation
cites work: Counter machines and counter languages
cites work: Weak models of distributed computing, with connections to modal logic
cites work: Q4227581
cites work: Theory of cellular automata: a survey
cites work: Q3527018
cites work: Cellular automata with sparse communication
cites work: Modal Logic and Distributed Message Passing Automata
cites work: Q3384173
cites work: Q3126969
cites work: Q4465339
cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines
cites work: Distributed Computing: A Locality-Sensitive Approach
cites work: SIMULATIONS BY TIME-BOUNDED COUNTER MACHINES
cites work: Q5111432
cites work: Q3908465
cites work: Some remarks about the ''efficiency'' of polyautomata
description: scientific article; zbMATH DE number 6916376