Abstract
In a general transition system the number of inverse images of a configuration by its global transition is often related with some characteristic behaviors (for example, the reversibility) of the system. This paper studies sequences of such numbers of inverse images, and gives a necessary and sufficient condition for the global transitions to be reversible, and finally we show how to determine the recursive formulas of inverse image sequences defined for triplet local rules by using de Bruijn subautomata.
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
Preview
Unable to display preview. Download preview PDF.
References
Inokuchi, S., et al.: On reversible cellular automata with finite cell array. In: Calude, C.S., Dinneen, M.J., Păun, G., Jesús Pérez-JÃmenez, M., Rozenberg, G. (eds.) UC 2005. LNCS, vol. 3699, pp. 130–141. Springer, Heidelberg (2005)
Inui, N., et al.: Statistical properties of a quantum cellular automaton. Physical Review AÂ 72, 032323
Shingai, R.: The maximum period realized in 1-D uniform neural networks. Trans. IECE, Japan E61, 804–808 (1978)
Wolfram, S.: Universality and complexity in cellular automata. Physica 10D, 1–35 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Tokyo
About this paper
Cite this paper
Sato, T., Honda, K., Lee, H.Y., Kawahara, Y. (2009). A Classification of Triplet Local Rules with Inverse Image Sequences. In: Suzuki, Y., Hagiya, M., Umeo, H., Adamatzky, A. (eds) Natural Computing. Proceedings in Information and Communications Technology, vol 1. Springer, Tokyo. https://doi.org/10.1007/978-4-431-88981-6_15
Download citation
DOI: https://doi.org/10.1007/978-4-431-88981-6_15
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-88980-9
Online ISBN: 978-4-431-88981-6
eBook Packages: Computer ScienceComputer Science (R0)