License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2016.115
URN: urn:nbn:de:0030-drops-62502
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6250/
Grandjean, Anaël ;
Poupet, Victor
A Linear Acceleration Theorem for 2D Cellular Automata on All Complete Neighborhoods
Abstract
Linear acceleration theorems are known for most computational models. Although such results have been proved for two-dimensional cellular automata working on specific neighborhoods, no general construction was known. We present here a technique of linear acceleration for all twodimensional languages recognized by cellular automata working on complete neighborhoods.
BibTeX - Entry
@InProceedings{grandjean_et_al:LIPIcs:2016:6250,
author = {Ana{\"e}l Grandjean and Victor Poupet},
title = {{A Linear Acceleration Theorem for 2D Cellular Automata on All Complete Neighborhoods}},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)},
pages = {115:1--115:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-013-2},
ISSN = {1868-8969},
year = {2016},
volume = {55},
editor = {Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6250},
URN = {urn:nbn:de:0030-drops-62502},
doi = {10.4230/LIPIcs.ICALP.2016.115},
annote = {Keywords: 2D Cellular automata, linear acceleration, language recognition}
}
|
Keywords: |
|
2D Cellular automata, linear acceleration, language recognition |
|
Collection: |
|
43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) |
|
Issue Date: |
|
2016 |
|
Date of publication: |
|
23.08.2016 |
