{'fraction_non_alphanumeric': 0.04326923076923077, 'fraction_numerical': 0.004807692307692308, 'mean_word_length': 4.085365853658536, '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}}
Digraphs and the semigroup of all functions on a finite set

Let Tn denote the full transformation semigroup on the finite set = {1, 2, … n}, that is the set of all mappings from to , with function composition as the semigroup operation. In this paper algorithms are introduced to solve equations such as axmb = c and ax = xb (a, b, c ∊ Tn), which employ a representation of members of Tn as special directed graphs.