<jupyter_start><jupyter_text>Translation<jupyter_code>f = PLFormula("p & q")
aut = f.translate()
print(aut)<jupyter_output>This Dfa has 3 states.
    Alphabet: {'q', 'p'}
    Starting state: 1
    Accepting states: {0}
    States: [0, 1, 2]
    Transition function:
		0 -- {} --> 0
		0 -- {'q'} --> 0
		0 -- {'p'} --> 0
		0 -- {'q', 'p'} --> 0
		1 -- {} --> 2
		1 -- {'q'} --> 2
		1 -- {'p'} --> 2
		1 -- {'q', 'p'} --> 0
		2 -- {} --> 2
		2 -- {'q'} --> 2
		2 -- {'p'} --> 2
		2 -- {'q', 'p'} --> 2
{'fraction_non_alphanumeric': 0.30060120240480964, 'fraction_numerical': 0.06012024048096192, 'mean_word_length': 1.7027027027027026, 'pattern_counts': {'":': 0, '<': 4, '<?xml version=': 0, '>': 16, '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}}
{'chain_length': '1', 'dir': 'jupyter-structured-clean-dedup', 'id': '244169', 'license': 'BSD-3-Clause', 'n_tokens_mistral': 244, 'n_tokens_neox': 213, 'n_words': 61, 'path': 'examples/logic/pl.ipynb', 'repo_name': 'abhibp1993/ggsolver', 'size': '499'}