{'fraction_non_alphanumeric': 0.018867924528301886, 'fraction_numerical': 0.0, 'mean_word_length': 5.3076923076923075, '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}}
Mathematization in teaching pumping lemmas

Theory of Computation provides students of the computing disciplines with understanding that some problems are not solvable, and that there is a range of complexities of problems, in terms of significant resources, including but not limited to time and memory. Theory of Computation acquaints students with reasoning processes by which they can know (for some cases) the complexity class of a given problem, and by which they can, for some problems they might find in the future, determine the complexity. People formulate these reasoning processes in symbols, and use logic with quantifiers; an example of this is the application of the pumping lemma for regular languages. We categorized the errors students made in applying the pumping lemma for regular languages, to develop an understanding of the possible misconceptions, in turn, to improve teaching.