Abstract
In contrast to many investigations of cellular automata with regard to their ability to accept inputs under certain time constraints, we are studying here cellular automata towards their ability to generate strings in real time. Structural properties such as speed-up 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 non-closure under union, complementation, and arbitrary homomorphism is obtained. Finally, decidability questions such as emptiness, finiteness, equivalence, inclusion, regularity, and context-freeness are addressed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bucher, W., Čulik II, K.: On real time and linear time cellular automata. RAIRO Inform. Théor. 18, 307–325 (1984)
Choffrut, C., Čulik II, K.: On real-time cellular automata and trellis automata. Acta Inform. 21, 393–407 (1984)
Dyer, C.R.: One-way bounded cellular automata. Inform. Control 44, 261–281 (1980)
Grandjean, A., Richard, G., Terrier, V.: Linear functional classes over cellular automata. In: Formenti, E. (ed.) International workshop on Cellular Automata and Discrete Complex Systems and Journées Automates Cellulaires (AUTOMATA & JAC 2012). EPTCS, vol. 90, pp. 177–193 (2012)
Hartmanis, J.: On the succinctness of different representations of languages. In: Maurer, H.A. (ed.) ICALP 1979. LNCS, vol. 71, pp. 282–288. Springer, Heidelberg (1979). https://doi.org/10.1007/3-540-09510-1_22
Ibarra, O.H., Kim, S.M., Moran, S.: Sequential machine characterizations of trellis and cellular automata and applications. SIAM J. Comput. 14, 426–447 (1985)
Ibarra, O.H., Palis, M.A.: Some results concerning linear iterative (systolic) arrays. J. Parallel Distrib. Comput. 2, 182–218 (1985)
Kari, J.: Universal pattern generation by cellular automata. Theor. Comput. Sci. 429, 180–184 (2012)
Kutrib, M.: Cellular automata - a computational point of view. In: Bel-Enguix, G., Jiménez-López, M.D., Martín-Vide, C. (eds.) New Developments in Formal Languages and Applications. SCI, vol. 113, pp. 183–227. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78291-9_6
Kutrib, M.: Cellular automata and language theory. In: Meyers, R. (ed.) Encyclopedia of Complexity and Systems Science, pp. 800–823. Springer, New York (2009). https://doi.org/10.1007/978-0-387-30440-3_54
Kutrib, M., Malcher, A.: One-dimensional cellular automaton transducers. Fundam. Inform. 126, 201–224 (2013)
Kutrib, M., Malcher, A.: One-dimensional pattern generation by cellular automata. LNCS. Springer (2020, to appear). Accepted at ACRI 2020
Smith III, A.R.: Cellular automata and formal languages. In: Symposium on Switching and Automata Theory, SWAT 1970, pp. 216–224. IEEE (1970)
Waksman, A.: An optimum solution to the firing squad synchronization problem. Inform. Control 9, 66–78 (1966)
Wolfram, S.: Random sequence generation by cellular automata. Adv. Appl. Math. 7, 123–169 (1986)
Acknowledgements
The authors would like to thank the anonymous referees for their useful comments and remarks.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 IFIP International Federation for Information Processing
About this paper
Cite this paper
Kutrib, M., Malcher, A. (2020). Cellular String Generators. In: Zenil, H. (eds) Cellular Automata and Discrete Complex Systems. AUTOMATA 2020. Lecture Notes in Computer Science(), vol 12286. Springer, Cham. https://doi.org/10.1007/978-3-030-61588-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-61588-8_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-61587-1
Online ISBN: 978-3-030-61588-8
eBook Packages: Computer ScienceComputer Science (R0)
