**@@ The definition says that a regular language is one where some finite automata exists recognizing it .. **

**$$ A regular language satisfies the following equivalent properties: :**

**# It is the language of a regular expression (by the above definition).. **

**## It is the language accepted by a nondeterministic finite automaton (NFA) .. **

**### It is the language accepted by a deterministic finite automaton (DFA).. **