{'fraction_non_alphanumeric': 0.023605150214592276, 'fraction_numerical': 0.027896995708154508, 'mean_word_length': 6.075757575757576, '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 Schematological Equivalence of Partially Interpreted Dataflow Networks

Abstract We provide a schematologically complete set of transformations for partially interpreted dataflow nets. This paper extends our results in (Inform. and Comput.124(1996), 154–167), where a schematologically complete set of transformations was provided for the nets which consist only of uninterpreted nodes and the results for partially interpreted nets were announced without proofs.