Is DFA and Regular Expression equivalent?
According to Wikipedia:

Given a finite alphabet $\Sigma$, the following constants are defined as regular expressions:

(empty set) $\emptyset$ denoting the set $\emptyset$.

...



... a string that contains only an empty-set symbol is a regular expression, which represents the empty language.