{'fraction_non_alphanumeric': 0.014256619144602852, 'fraction_numerical': 0.0, 'mean_word_length': 4.406593406593407, '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}}
A Simple State-Space Reduction Method

We are often interested in finding out if a given predicate on states of a system can be satisfied in any or all of the systems reachable states. To determine this, one approach is to calculate the complete set of reachable states and evaluate the predicate on each of these states. To know which states we have already examined and which we have yet to examine—and thus knowing when we have examined all states—we store the examined states in a table.