{'fraction_non_alphanumeric': 0.02074688796680498, 'fraction_numerical': 0.0, 'mean_word_length': 4.8861788617886175, '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}}
Synthesis of binary cellular automata based on binary neural networks

This paper studies a simple synthesis algorithm of desired cellular automata (ab. CAs) based on a binary neural network (ab. BNN). The CAs have binary state variable and the BNN has bipolar connection parameters. In order to realize dynamics of the CA, the bipolar parameters of BNN are determined using the genetic algorithm. Performing basic numerical experiments we show that the BNN can realize desired dynamics with small number of hidden layers for a class of CAs. We also consider the case of noisy teacher signals. These results provide basic information for application to signal processing, analysis of digital nonlinear phenomena, and so on.