= Solution
The assertion is \b[true]. Every single finite <string> $w=b_1\cdots b_k$ over $\{0,1\}$ is denoted by the <regular expression> $b_1\cdots b_k$. The empty <string> is denoted by $\epsilon$. Hence if $F=\{w_1,\ldots,w_m\}$ is a finite <formal language>, the <regular expression>
$$
\boxed{w_1+w_2+\cdots+w_m}
$$
denotes precisely $F$, with each $w_j$ read as its concatenation of symbols. This uses the defining union and concatenation operations for <regular expressions>. For $F=\varnothing$, use the <regular expression> $\varnothing$. Therefore
$$
\boxed{\text{Every finite binary language is regular}.}
$$
Back to article page
