{'fraction_non_alphanumeric': 0.013089005235602094, 'fraction_numerical': 0.0, 'mean_word_length': 5.169354838709677, '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}}
Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation

We consider the problem of how the size of a nondeterministic finite automaton (nfa) representing a regular language depends on the degree of ambiguity of the nfa. We obtain results for the unary and bounded inputs, and partial results for the unrestricted inputs. One of the main results of this paper shows that for unrestricted inputs, deterministic, unambiguous and nondeterministic machines form a hierarchy with respect to the number of states, solving an open problem of Stearns and Hunt. We also propose a new approach to the study of the succinctness of representation through regularity preserving closure properties and obtain some results in this direction.