Sublinear-Time Probabilistic Cellular Automata

by   Augusto Modanese, et al.

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 𝖱𝖯 and 𝖑𝖯𝖯) and establish a separation between the classes of languages they can recognize all the way up to o(√(n)) time. We also prove that the derandomization of T(n)-time PACA (to polynomial-time deterministic cellular automata) for various regimes of T(n) = Ο‰(log n) implies non-trivial derandomization results for the class 𝖱𝖯 (e.g., 𝖯 = 𝖱𝖯). The main contribution is an almost full characterization of the constant-time PACA classes: For one-sided error, the class is equal to that of the deterministic model; that is, constant-time one-sided error PACA can be fully derandomized with only a constant multiplicative overhead in time complexity. As for two-sided error, we prove that the respective class is "sandwiched" in-between the class of strictly locally testable languages (𝖲𝖫𝖳) and that of locally threshold testable languages (𝖫𝖳𝖳).


page 1

page 2

page 3

page 4

βˆ™ 09/12/2019

Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata

After an apparent hiatus of roughly 30 years, we revisit a seemingly neg...
βˆ™ 10/23/2017

Conjugacy of one-dimensional one-sided cellular automata is undecidable

Two cellular automata are strongly conjugate if there exists a shift-com...
βˆ™ 02/14/2019

Complexity-Theoretic Aspects of Expanding Cellular Automata

The expanding cellular automata (XCA) variant of cellular automata is in...
βˆ™ 12/28/2022

Classical and quantum Merlin-Arthur automata

We introduce Merlin-Arthur (MA) automata as Merlin provides a single cer...
βˆ™ 11/09/2021

Behavioral Strengths and Weaknesses of Various Models of Limited Automata

We examine the behaviors of various models of k-limited automata, which ...
βˆ™ 12/21/2019

Lower bounds for the state complexity of probabilistic languages and the language of prime numbers

This paper studies the complexity of languages of finite words using aut...
βˆ™ 11/22/2022

Building Squares with Optimal State Complexity in Restricted Active Self-Assembly

Tile Automata is a recently defined model of self-assembly that borrows ...

Please sign up or login with your details

Forgot password? Click here to reset