This dissertation presents three different approaches to representing Regular Formal languages, i.e., regular expressions, finite acceptors and regular grammars. We define how each method is used to represent the language, ...