From Regular Expressions to Finite Automata

Regular Expressions allow for a concise definition of a language. They do not directly give a hint, how to check if a word is in the language defined by the expression. A finite automaton can perform this check easily and can be implemented in hardware or software directly. For each regular expression, we can construct inductively a nondeterministic finite automaton building on known constructions for operations on regular languages.