Sublinear-Time Probabilistic Cellular Automata
Loading...
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal
View/Open full text file from the Research portal
Other link related to publication
View publication in the Research portal
View/Open full text file from the Research portal
Other link related to publication
Author
Date
2023-03-01
Major/Subject
Mcode
Degree programme
Language
en
Pages
Series
40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, Leibniz International Proceedings in Informatics, LIPIcs, Volume 254
Abstract
We propose and investigate a probabilistic model of sublinear-time one-dimensional cellular automata. In particular, we modify the model of ACA (which are cellular automata that accept if and only if all cells simultaneously accept) so that every cell changes its state not only dependent on the states it sees in its neighborhood but also on an unbiased coin toss of its own. The resulting model is dubbed probabilistic ACA (PACA). We consider one- and two-sided error versions of the model (in the same spirit as the classes RP and BPP) and establish a separation between the classes of languages they can recognize all the way up to o(√n) time. As a consequence, we have a Ω(√n) lower bound for derandomizing constant-time one-sided error PACAs (using deterministic ACAs). We also prove that derandomization of T(n)-time PACAs (to polynomial-time deterministic cellular automata) for various regimes of T(n) = ω(log n) implies non-trivial derandomization results for the class RP (e.g., P = RP). The main contribution is an almost full characterization of the constant-time PACA classes: For one-sided error, the class equals that of the deterministic model; that is, constant-time one-sided error PACAs can be fully derandomized with only a constant multiplicative overhead in time complexity. As for two-sided error, we identify a natural class we call the linearly testable languages (LLT) and prove that the languages decidable by constant-time two-sided error PACAs are “sandwiched” in-between the closure of LLT under union and intersection and the class of locally threshold testable languages (LTT).Description
Funding Information: Funding Supported by Helsinki Institute for Information Technology (HIIT). Much of this work done while affiliated with the Karlsruhe Institute of Technology (KIT). Publisher Copyright: © Augusto Modanese.
Keywords
Cellular automata, local computation, probabilistic models, subregular language classes
Citation
Modanese , A 2023 , Sublinear-Time Probabilistic Cellular Automata . in P Berenbrink , P Bouyer , A Dawar & M M Kante (eds) , 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023 . , 47 , Leibniz International Proceedings in Informatics, LIPIcs , vol. 254 , Schloss Dagstuhl - Leibniz-Zentrum für Informatik , Symposium on Theoretical Aspects of Computer Science , Hamburg , Germany , 07/03/2023 . https://doi.org/10.4230/LIPIcs.STACS.2023.47
