{'fraction_non_alphanumeric': 0.021712907117008445, 'fraction_numerical': 0.0, 'mean_word_length': 5.148148148148148, '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}}
Increasing the experimentation of theoretical computer science with new features in JFLAP

JFLAP is an educational software tool for experimenting with several types of automata, grammars and proofs related to the area of theoretical computer science. For example, one can create an NFA, convert it to a DFA, minimize the number of states in the DFA, convert it to a regular expression or convert it to a regular grammar. Once created, one can simulate test strings. JFLAP includes a large number of topics and proofs to experiment with from the regular languages, context-free languages, recursively enumerable languages and l-systems. This poster describes several new features in a redesign of JFLAP that includes a more flexible grammar representation, explicit formal definitions, basic set theory tools, and new algorithms.