{'fraction_non_alphanumeric': 0.01384083044982699, 'fraction_numerical': 0.0, 'mean_word_length': 6.423076923076923, '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': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Development of Zakrevskij's Minimization Strategy towards Arithmetical Polynomial Domain

In this paper we study the possibility of using the called staircase strategy, originally presented by Zakrevskij, for minimization Boolean function in Arithmetical Polynomials forms. The results on developing staircase minimization strategy to find a quasi-optimal Arithmetical Polynomial forms for both completely and incompletely specified Boolean functions is presented. The experimental results for benchmarks and the comparison with well-known minimization strategies are discussed.