Regular Languages and Finite-State Machiness William David Shoaff (wds@fit.edu) Spring 2023 Regular Languages and Finite State Machines Throughout this course you will learn about language classes and a machine that can decide if a string is or is not in a language of a given class. As a team write a report on the items listed below. Submit your report on Canvas. Each team member must submit the team's report which must include a task matrix. - Read the Wikipedia article on regular grammars. Summarize the salient points. - What is a Deterministic Finite Accepter (DFA) - What is a Non-Deterministic Finite Accepter (NFA) - Explain why the languages accepted by by DFAs and NFAs are the equivalent. - Give a recursive definition of regular expression over an alphabet . - Confirm you know how to use operating system commands to find regular expressions in a file