{'fraction_non_alphanumeric': 0.015277777777777777, 'fraction_numerical': 0.0, 'mean_word_length': 5.614678899082569, 'pattern_counts': {'":': 0, '<': 1, '<?xml version=': 0, '>': 1, '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}}
The theorem about combinatorial linearization of data processing alhoritmic complexes

in this article has been proved the theorem about combinatorial linearization for models < MN, AMN > of arbitrary DPACs. It has been utilized the way of immersion initial problem in more general problem of reduction model’s associated orgraph AMN contiguity matrix SN to upper-triangle form. In this theoretical context the problem is solved with help of three types of standard procedures: local division, inversion and local reregulating of RMs. Theoretical redundancy of this proof opens additional heuristic possibilities for combinatorial linearization of concrete models with taking into account specificity of their structure.