{'fraction_non_alphanumeric': 0.013059701492537313, 'fraction_numerical': 0.0, 'mean_word_length': 4.966666666666667, '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 computation of De Morgan and quasi-De Morgan functions

In this paper we give various algorithms for computation of De Morgan and quasi-De Morgan functions. We define the disjunctive and conjunctive normal forms for De Morgan and quasi-De Morgan functions and introduce the concept of Zhegalkin polynomial for the case of quasi-De Morgan functions as well as prove some results analogous to the classical Zhegalkin representation theorem on Boolean functions. The obtained results have richer matter that those in the classical case.