0 votes 0 votes $L^{*}-\{{\epsilon }\}=L^{+}$. True or False? (Given L is a language) Theory of Computation regular-language theory-of-computation made-easy-test-series + – CS.user asked Jan 13, 2019 • edited Mar 4, 2019 by ajaysoni1924 CS.user 637 views answer comment Share Follow See all 12 Comments See all 12 12 Comments reply Magma commented Jan 13, 2019 reply Follow Share Kunal Kadian but here it not a string it's language right ?? 1 votes 1 votes CS.user commented Jan 13, 2019 reply Follow Share L is not alphabets, it is a language. is it true for language also? 0 votes 0 votes Magma commented Jan 13, 2019 reply Follow Share false 0 votes 0 votes Shobhit Joshi commented Jan 13, 2019 reply Follow Share False for $L=\left \{ \right \}$ 0 votes 0 votes Kunal Kadian commented Jan 13, 2019 reply Follow Share yes got it. Thanks for testcase 0 votes 0 votes Nandkishor3939 commented Jan 13, 2019 reply Follow Share If it was like: L* -{ ϵ } = L+ given L is a language made from (a,b) then? 0 votes 0 votes Shobhit Joshi commented Jan 13, 2019 reply Follow Share When we got a contradicting case why check other, the statement is false 0 votes 0 votes CS.user commented Jan 13, 2019 reply Follow Share How? can you please explain? @Shobhit Joshi 0 votes 0 votes Shobhit Joshi commented Jan 13, 2019 reply Follow Share $L=\left\{\right \}$, for this the given statement is not True. Hence, the statement is False 0 votes 0 votes Nandkishor3939 commented Jan 13, 2019 reply Follow Share I am asking it in general : IF this is given in exam then what will be our approach If it was like: L* -{ ϵ } = L+ given L is a language made from (a,b) then? 0 votes 0 votes gauravkc commented Jan 13, 2019 reply Follow Share Even if L is empty, it's Kleene closure will have epsilon. 0 votes 0 votes codingo1234 commented Nov 13, 2019 reply Follow Share Can someone confirm it 0 votes 0 votes Please log in or register to add a comment.