{'fraction_non_alphanumeric': 0.013779527559055118, 'fraction_numerical': 0.005905511811023622, 'mean_word_length': 4.302083333333333, '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}}
Euler paths and ends in automatic and recursive graphs

It is shown that the existence of an Euler path in a recursive graph is complete for the class DΣ 3 of all set differences of two Σ 3 sets. The same problem for highly recursive graphs as well as automatic graphs is shown to be Π 2 -complete. Moreover, the arithmetic level for bounding the number of ends in an automatic/recursive graph as well as computing the number of infinite paths in an automatic/recursive finitely branching tree is determined.