Reflection on Regular Languages

Write up YOUR answers to the following prompts and submit a pdf file on Kit. These should be your words, demonstrating what YOU have learned. If I wanted ChatGPT's (or any other source's) answers I would ask them!

• What is a finite automaton? What is a regular language?
• What types of problems can finite automaton or regular expressions be used to model?
• Give an example of a language that is not regular. What characteristics does the language have that makes a finite automaton not a powerful enough tool to recognize it? Discuss how you would prove this language is not regular. (You do not need to give the proof, but you should include how and why the Pumping Lemma can be applied.)
• (Overall reflection) Reflect on what you have learned so far from the readings, in-class discussions, and assignments. What has been new or surprising? What has been the most interesting? What has been the most challenging? How has what you have learned so far changed or deepened your understanding of computers or computing?