Counter Machines and Distributed Automata - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Counter Machines and Distributed Automata

(1) , (2) , (3)
1
2
3

Abstract

We prove the equivalence of two classes of counter machines and one class of distributed automata. Our counter machines operate on finite words, which they read from left to right while incrementing or decrementing a fixed number of counters. The two classes differ in the extra features they offer: one allows to copy counter values, whereas the other allows to compute copyless sums of counters. Our distributed automata, on the other hand, operate on directed path graphs that represent words. All nodes of a path synchronously execute the same finite-state machine, whose state diagram must be acyclic except for self-loops, and each node receives as input the state of its direct predecessor. These devices form a subclass of linear-time one-way cellular automata.
Fichier principal
Vignette du fichier
469010_1_En_2_Chapter.pdf (332 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01824873 , version 1 (27-06-2018)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Olivier Carton, Bruno Guillon, Fabian Reiter. Counter Machines and Distributed Automata. 24th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2018, Ghent, Belgium. pp.13-28, ⟨10.1007/978-3-319-92675-9_2⟩. ⟨hal-01824873⟩
127 View
34 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More