Tag: Mathematics Undergraduate Seminar Series

Mathematics Undergraduate Seminar Series presents “Formal Languages, Finite State Automata, Regular Expressions, and Computational Problems in Mathematics (Part II)” today

In part I of this series, we introduced formal language theory, focusing on languages that are recognized by simple computational machines called Finite State Automata. In part II, we turn our attention to how Finite State Automata (FSA) can be used to solve computational problems in groups.

Mathematics Undergraduate Seminar Series presents “Formal Languages, Finite State Automata, Regular Expressions, and Computational Problems in Mathematics (Part I)” today

What is needed in order to form a language? In their most basic form, languages require an alphabet (a set of letters) and a collection of finite strings of letters called words. In order to recognize a language, one must be able to distinguish strings of letters that form words from those that do not form words.