String Generation by Cellular Automata
- 15 June 2021
- journal article
- research article
- Published by Wolfram Research, Inc. in Complex Systems
- Vol. 30 (2), 111-132
- https://doi.org/10.25088/complexsystems.30.2.111
Abstract
In contrast to many investigations of cellular automata with regard to their ability to accept inputs under certain time constraints, in this paper we are studying cellular automata with regard to their ability to generate strings in real time. Structural properties such as speedup results and closure properties are investigated. On the one hand, constructions for the closure under intersection, reversal and length-preserving homomorphism are presented, whereas on the other hand the nonclosure under union, complementation and arbitrary homomorphism are obtained. Finally, decidability questions such as emptiness, finiteness, equivalence, inclusion, regularity and context-freeness are addressed.Keywords
This publication has 3 references indexed in Scilit:
- One-Dimensional Cellular Automaton TransducersFundamenta Informaticae, 2013
- Linear functional classes over cellular automataElectronic Proceedings in Theoretical Computer Science, 2012
- Universal pattern generation by cellular automataTheoretical Computer Science, 2012