{'fraction_non_alphanumeric': 0.021339220014716703, 'fraction_numerical': 0.005886681383370125, 'mean_word_length': 5.210045662100456, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
The Transition Rules of 2D Linear Cellular Automata Over Ternary Field and Self-Replicating Patterns

In this paper we start with two-dimensional (2D) linear cellular automata (CA) in relation with basic mathematical structure. We investigate uniform linear 2D CA over ternary field, i.e. ℤ3. Present work is related to theoretical and imaginary investigations of 2D linear CA. Even though the basic construction of a CA is a discrete model, its macroscopic level behavior at large times and on large scales could be a close approximation to a continuous system. Considering some statistical properties, someone may also study geometrical aspects of patterns generated by cellular automaton evolution. After iteratively applying the linear rules, CA have been shown capable of producing interesting complex behaviors. Some examples of CA produce remarkably regular behavior on finite configurations. Using some simple initial configurations, the produced pattern can be self-replicating regarding some linear rules. Here we deal with the theory 2D uniform periodic, adiabatic and reflexive boundary CA (2D PB, AB and RB) over the ternary field ℤ3 and the applications of image processing for patterns generation. From the visual appearance of the patterns, it is seen that some rules display sensitive dependence on boundary conditions and their rule numbers.