{'fraction_non_alphanumeric': 0.017786561264822136, 'fraction_numerical': 0.0, 'mean_word_length': 4.571428571428571, '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 languages not recognizable by One-way Measure Many Quantum Finite automaton ?

Measure Many Quantum Finite Automaton is not the strongest known model of quantum automaton but, it is still an open question what is the class of languages recognized by it when only bounded error probability is allowed. In this paper a natural class of ”word set” regular languages are studied. A proof that in general case the class can not be recognized by One-way model of Measure Many Quantum Finite automata is given.