Counter machines and distributed automata -- a story about exchanging space and time

DOI10.1007/978-3-319-92675-9_2OpenAlexW3125648682MaRDI QIDQ1656682

Olivier Carton, Fabian Reiter, Bruno Guillon

Publication date: 10 August 2018

Full work available at URL: https://arxiv.org/abs/1804.03582

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Cellular automata (computational aspects) (68Q80)

Related Items (6)

Emptiness problems for distributed automata ⋮ Cold dynamics in cellular automata: a tutorial ⋮ Iterative arrays with finite inter-cell communication ⋮ Iterative arrays with finite inter-cell communication ⋮ The mirage of universality in cellular automata ⋮ Freezing, Bounded-Change and Convergent Cellular Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some remarks about the efficiency of polyautomata
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Indirect addressing and the time relationships of some models of sequential computation
• Theory of cellular automata: a survey
• Cellular automata with sparse communication
• Modal Logic and Distributed Message Passing Automata
• SIMULATIONS BY TIME-BOUNDED COUNTER MACHINES
• One-way bounded cellular automata
• Distributed Computing: A Locality-Sensitive Approach
• Regular Functions and Cost Register Automata
• Counter machines and counter languages
• Weak models of distributed computing, with connections to modal logic

This page was built for publication: Counter machines and distributed automata -- a story about exchanging space and time