If a language X regular, then is the complement of X also a regular language? If yes, then thank you, else can you please explain why
Asked
Active
Viewed 118 times
1 Answers
1
Yes, the complement of a regular language is regular. If $L$ is regular then there is a DFA accepting that language. In particular, its states can be classified as ACCEPTING states and non-ACCEPTING states. Just turn non-ACCEPTING states into ACCEPTING, and ACCEPTING states into non-ACCEPTING states and you will have a DFA accepting $\overline{L}$.
fade2black
- 9,905
- 2
- 26
- 36