Peter Linz Edition 4 Exercise 2.1 Question 17 (Page No. 48)

Question

Show that if $L$ is regular, so is $L -$ {$λ$} .

Answer 1

regular language are closed under set diffrence.

 

 

Answer 2

$\lambda=null\; string$

Let $L_1=\{\lambda\}$

So  $L-L_1=L\cap \bar L_1$

regular languages are closed under intersection and complementation.

$\implies{L-\{\lambda\}} \text{  is regular}$

---