{'fraction_non_alphanumeric': 0.025906735751295335, 'fraction_numerical': 0.0, 'mean_word_length': 5.45, '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}}
Computing Small Nondeterministic Finite Automata

We study the minimization problem for nondeterministic nite automata. Two approaches are discussed, based on the construction of two versions of \canonical" automata (for a given regular language), in which minimal automata occur as subautomata. We introduce a heuristic for this search, which has been implemented in the program AMoRE.