1,237 views

Let $L \subseteq \{0,1\}^*$ be an arbitrary regular language accepted by a minimal $\text{DFA}$ with $k$ states. Which one of the following languages must necessarily be accepted by a minimal $\text{DFA}$ with $k$ states?

1. $L-\{01\}$
2. $L \cup \{01\}$
3. $\{0,1\}^* – L$
4. $L \cdot L$