{'fraction_non_alphanumeric': 0.019667170953101363, 'fraction_numerical': 0.0, 'mean_word_length': 4.8584070796460175, '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}}
Genetic Algorithms and Equations in Free Groups and Semigroups

We give a brief account of some of the traditional ways that genetic algo- rithms have been applied, and explain how our approach to the use of genetic algorithms for solving problems in combinatorial group theory differs. We find that, in our situation, there seems to be a correlation between successful genetic algorithms and the existence of good non-genetic, sometimes deterministic, algorithms. We use a class of equations in free groups as a test bench. In particular, it allows us to trace the convergence of co-evolution of the population of fitness functions to a deterministic solution.