{'fraction_non_alphanumeric': 0.024675324675324677, 'fraction_numerical': 0.0, 'mean_word_length': 5.7043478260869565, '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}}
Split Multi-terminal Binary Decision Diagrams

A new data structure called Split Multi-terminal Binary Decision Diagrams (Split MTBDD) is introduced for representing Multi–Output logic Functions (MOF). Split MTBDDs are efficient for some functions where conventional BDDs are not. A Split MTBDD comprises interconnected MTBDD components, each associated with a “dichotomic fragment”. The “dichotomy” reflects cognitive patterns introduced by the designer of a MOF specification. The paper describes a method of transforming an arbitrary MOF into a corresponding Split MTBDD. Experimental results indicate that Split MTBDDs are more compact than conventional MTBDDs for many benchmarks. Criteria for prediction of the Split MTBDD compactness are formulated and justified.