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.