Abstract
We investigate cellular automata as acceptors for formal languages. In particular, we consider real-time one-way cellular automata ( $$\text{OCA}$$ ) with the additional property that during a computation any cell of the $$\text{OCA}$$ has the ability to dissolve itself, so-called shrinking one-way cellular automata ( $$\text{SOCA}$$ ). It turns out that real-time $$\text{SOCA}$$ are more powerful than real-time $$\text{OCA}$$ , since they can accept certain linear-time $$\text{OCA}$$ languages. On the other hand, linear-time $$\text{OCA}$$ are more powerful than real-time $$\text{SOCA}$$ , which is witnessed even by a unary language. Additionally, a construction is provided that enables real-time $$\text{SOCA}$$ to accept the reversal of real-time iterative array languages. Finally, restricted real-time $$\text{SOCA}$$ are investigated. We distinguish two limitations for the dissolving of cells. One restriction is to bound the total number of cells that are allowed to dissolve by some function. In this case, an infinite strict hierarchy of language classes is obtained. The second restriction is inspired by an approach to limit the amount of nondeterminism in $$\text{OCA}$$ . Compared with the first restriction, the total number of cells that may dissolve is still unbounded, but the number of time steps at which a cell may dissolve is bounded. The possibility to dissolve is allowed only in the first k time steps, where $$k\ge 0$$ is some constant. For this mode of operation an infinite, tight, and strict hierarchy of language classes is obtained as well.
Highlights
Devices of homogeneous, interconnected, parallel acting automata have widely been investigated from a computational capacity point of view
The in a way simplest model of CA is that of real-time one-way cellular automata (OCA) [4]
The class of languages accepted by real-time OCA is properly included both in the class of languages accepted by real-time CA and by linear-time OCA
Summary
Devices of homogeneous, interconnected, parallel acting automata have widely been investigated from a computational capacity point of view. It turns out that real-time SOCA where the number of dissolved cells in accepting computations is bounded by some function r depending on the length of the input, can be simulated by conventional OCA which work in time n + r(n). This enables us to utilize results known for the time hierarchy between real-time and linear-time OCA and to obtain an infinite hierarchy with regard to the number of dissolved cells
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
