Question

Give regular expressions describing each of the following regular languages over Σ = {0,1}:

1. {w : |w| = 3}

(PLEASE SHOW WORK)

Answer 1

Answer:
--------
(0+1)(0+1)(0+1)

Explanation:
--------------
(0+1) matches exactly one 0 or 1
so, three of them (0+1)(0+1)(0+1) matches strings over {0, 1} with length of exactly 3