License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2011.273
URN: urn:nbn:de:0030-drops-30172
URL: http://drops.dagstuhl.de/opus/volltexte/2011/3017/
Go to the corresponding LIPIcs Volume Portal


Borelllo, Alex ; Richard, Gaetan ; Terrier, Veronique

A speed-up of oblivious multi-head finite automata by cellular automata

pdf-format:
Document 1.pdf (1,238 KB)


Abstract

In this paper, we present a parallel speed-up of a simple, yet significantly powerful, sequential model by cellular automata. The simulated model is called oblivious multi-head finite automata and is characterized by the fact that the trajectory of the heads only depends on the length of the input word. While the original $k$-head finite automaton works in time $O(n^k)$, its corresponding cellular automaton performs the same task in time $O(n^(k-1)log(n))$ and space $O(n^(k - 1))$.

BibTeX - Entry

@InProceedings{borelllo_et_al:LIPIcs:2011:3017,
  author =	{Alex Borelllo and Gaetan Richard and Veronique Terrier},
  title =	{{A speed-up of oblivious multi-head finite automata by cellular automata}},
  booktitle =	{28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) },
  pages =	{273--283},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-25-5},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{9},
  editor =	{Thomas Schwentick and Christoph D{\"u}rr},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3017},
  URN =		{urn:nbn:de:0030-drops-30172},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.STACS.2011.273},
  annote =	{Keywords: oblivious multi-head finite automata, cellular automata, parallel speed-up, simulation}
}

Keywords: oblivious multi-head finite automata, cellular automata, parallel speed-up, simulation
Seminar: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)
Issue Date: 2011
Date of publication: 11.03.2011


DROPS-Home | Fulltext Search | Imprint Published by LZI