-1

Assume L is regular language, define 1 = {: ∈ , ∉ }, prove or dispute L1 regular or not ?

Raphael
  • 73,212
  • 30
  • 182
  • 400
user87202
  • 1

1 Answers1

1

It’s regular.

First we can gain a DFA $M$ which accepts the given language $L$. Similarly we have a DFA $\bar M$ which accepts regular language $\bar L$.

Then we can construct a new NFA by adding an $\epsilon$ transition from all the final states in $M$ to $\bar M$’s initial state, which accepts that required language.

Wenzel
  • 88
  • 1
  • 9