{'fraction_non_alphanumeric': 0.041990668740279936, 'fraction_numerical': 0.013996889580093312, 'mean_word_length': 4.962962962962963, '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}}
The Parallel Complexity of Deterministic and Probabilistic Automata

A deterministic (probabilistic) automaton is said to be in TC0 whenever its transitions (stochastic event) can be computed by threshold circuits of polynomial size and constant depth. Here, we prove that: • The class of deterministic automata in TC0 is closed under homomorphism, sub-automaton, and α0-product operations. • The class of k-state deterministic (probabilistic) automata is contained in TC0 if and only if k ≤ 4 (k ≤ 2), unless TC0 = NC1. Moreover, the possibility of ranking regular languages in TC0 is related to the group-structure of their syntactic monoid.