Abstract
The goal is to find all patterns (space-time evolutions) that can be generated by a simple binary 1D block substitution rule (BCA), the Twin-Toggle Rule. The 1D space is partitioned into even or odd cell pairs. The even and odd partition are alternated in time. If the two bits in a pair are equal, then they are substituted by their logical inverses. Firstly, all possible initial configurations are reduced to a set of representatives taking into account 0/1-inversion, cyclic shift and mirroring. Secondly, the BCA was simulated and all patterns were compared to each other for similarities (black/white-inversion, shift, rotation, mirroring). Only a small amount of them was stored, representing all possible patterns. Most of the patterns are single patterns (the pixel structure is the same for black and white pixels). For \(N = 8, 12\) cells interesting dual patterns were discovered, which show a different structure for black and white pixels.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Prusinkiewicz, P.: Modeling and visualization of biological structures. In: Proceeding of Graphics Interface, pp. 128–137. Toronto (1993)
Pickover, C.A.: The Pattern Book: Fractals, Art and Nature. World Scientific Publishing Co., Inc., River Edge (1995)
Adamatzky, A., Martnez, J. (eds.): Designing Beauty: The Art of Cellular Automata. Emergence, Complexity and Computation, vol. 20. Springer, Berlin (2016)
Achasova, S., Bandman, O., Markova, V., Piskunov, S.: Parallel Substitution Algorithm: Theory and Application. World Scientific, Singapore (1994)
Hoffmann, R.: How agents can form a specific pattern. In: ACRI Conference on 2014. LNCS, vol. 8751, pp. 660–669 (2014)
Margolus, N.: Physics-like models of computation. Phys. D 10, 81–95 (1984)
Morita, K., Harao, M.: Computation Universality of one dimensional reversible (injective) cellular automata. Trans. IEICE Jpn. E72, 758–762 (1989)
Morita, K.: Reversible simulation of one-dimensional irreversible cellular automata. Theor. Comput. Sci. 148, 157–163 (1995)
Kari, J.: Representation of reversible cellular automata with block permutations. Theory Comput. Syst. 29, 47–61 (1996). Springer
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Hoffmann, R. (2018). Simple Block-Substitution Rule Exhibits Interesting Patterns. In: Adamatzky, A. (eds) Reversibility and Universality. Emergence, Complexity and Computation, vol 30. Springer, Cham. https://doi.org/10.1007/978-3-319-73216-9_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-73216-9_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-73215-2
Online ISBN: 978-3-319-73216-9
eBook Packages: EngineeringEngineering (R0)