{'fraction_non_alphanumeric': 0.02511415525114155, 'fraction_numerical': 0.0, 'mean_word_length': 4.628205128205129, '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}}
On the S-semigroups of automata

The author of this thesis attempted to use the S-semigroups to determine series-parallel, and feedback decompositions of automata. This attempt was frustrated by a lack of knowledge of the structure of S-semigroups. Nor was it possible to determine the relation between an S-semigroup of an automaton and the S-semigroups of the automata involved in a decomposition of that automaton, for the same reason.