Giessener Elektronische Bibliothek

GEB - Giessener Elektronische Bibliothek

Cellular automata with sparse communication

Kutrib, Martin ; Malcher, Andreas


Zum Volltext im pdf-Format: Dokument 1.pdf (217 KB)


Bitte beziehen Sie sich beim Zitieren dieses Dokumentes immer auf folgende
URN: urn:nbn:de:hebis:26-opus-90815
URL: http://geb.uni-giessen.de/geb/volltexte/2012/9081/

Bookmark bei Connotea Bookmark bei del.icio.us


Universität Justus-Liebig-Universität Gießen
Institut: Institut für Informatik
Fachgebiet: Informatik
DDC-Sachgruppe: Informatik
Dokumentart: ResearchPaper
Zeitschrift, Serie: IFIG Research Report ; 0903 / 2009
Sprache: Englisch
Erstellungsjahr: 2009
Publikationsdatum: 23.11.2012
Kurzfassung auf Deutsch: We investigate cellular automata whose internal inter-cell communication is bounded. The communication is quantitatively measured by the number of uses of the links between cells. Bounds on the sum of all communications of a computation as well as bounds on the maximal number of communications that may appear between each two cells are considered. It is shown that even the weakest non-trivial device in question, that is,one-way cellular automata where each two neighboring cells may communicate constantly often only, accept rather complicated languages. We investigate the computational capacity of the devices in question and prove an infinite strict hierarchy depending on the bound on the total number of communications during a computation. Despite their sparse communication even for the weakest devices, by reduction of Hilbert´s tenth problem undecidability of several problems is derived. Finally, the question whether a given real-time one-way cellular automaton belongs to the weakest class is shown to be undecidable. This result can be adapted to answer an open question posed in [Vollmar, R.: Zur Zustandsänderungskomplexität von Zellularautomaten. In: Beiträge zur Theorie der Polyautomaten—zweite Folge,Braunschweig (1982) 139–151 (in German)].
Lizenz: Veröffentlichungsvertrag für Publikationen ohne Print on Demand