Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2015.367
URN: urn:nbn:de:0030-drops-49275
URL: https://drops.dagstuhl.de/opus/volltexte/2015/4927/
Grandjean, Anaël ; Poupet, Victor
Comparing 1D and 2D Real Time on Cellular Automata
| pdf-format: |
|
Abstract
We study the influence of the dimension of cellular automata (CA) for real time language recognition of one-dimensional languages with parallel input. Specifically, we focus on the question of determining whether every language that can be recognized in real time on a 2-dimensional CA working on the Moore neighborhood can also be recognized in real time by a 1-dimensional CA working on the standard two-way neighborhood. We show that 2-dimensional CA in real time can perform a linear number of simulations of a 1-dimensional real time CA. If the two classes are equal then the number of simulated instances can be polynomial.
BibTeX - Entry
@InProceedings{grandjean_et_al:LIPIcs:2015:4927,
author = {Ana{\"e}l Grandjean and Victor Poupet},
title = {{Comparing 1D and 2D Real Time on Cellular Automata}},
booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)},
pages = {367--378},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-78-1},
ISSN = {1868-8969},
year = {2015},
volume = {30},
editor = {Ernst W. Mayr and Nicolas Ollinger},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/4927},
URN = {urn:nbn:de:0030-drops-49275},
doi = {10.4230/LIPIcs.STACS.2015.367},
annote = {Keywords: Cellular automata, real time, language recognition}
}
| Keywords: | Cellular automata, real time, language recognition | |
| Seminar: | 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015) | |
| Issue date: | 2015 | |
| Date of publication: | 26.02.2015 |
