{'fraction_non_alphanumeric': 0.02700675168792198, 'fraction_numerical': 0.0015003750937734434, 'mean_word_length': 4.700854700854701, '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}}
Comparative study on Null Boundary and Periodic Boundary 3-neighborhood Multiple Attractor Cellular Automata for classification

This paper reports a generic analysis on null boundary and periodic boundary 3-neighborhood multiple attractor cellular automata (MACA) for showing the comparative study in classification technique. Cellular automata (CA) is now-a-days an essential tool for researchers in the area of pattern recognition, pattern generation, testing field, fault diagnosis and so on. So, general knowledge on CA up to some extent is a must for researchers in these areas. A CA may be linear or non-linear in behavior. A linear/additive CA employs XOR/XNOR logic, while a non-linear CA employs AND/OR/NOT logic. This paper shows a graph analysis along with state transition behavior of CA cells. A rule vector graph (RVG) is generated from the rule vector (RV) of a CA. Linear time algorithms are reported for generation of RVG. MACA provides an implicit memory to store the patterns. Search operation to identify the class of a pattern out of several classes boils down to running a CA for one time step. This demands storage of RV and seed values. MACA is based on sound theoretical foundation of CA technology. This paper only concentrates on MACA since it is responsible for classifying the various types of patterns.