5 votes 5 votes Which of the following is TRUE? S1: Any language L over an alphabet Σ,L+=L-{ϵ} is always TRUE. S2: For any automata M, L(M)≠∅( Marks: 0.00 ) S1,S2 Only S1 Only S2 Both the statements are false atul_21 asked Jun 24, 2017 atul_21 685 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes 4.both are false Vaishali Patel answered Jun 25, 2017 selected Oct 17, 2017 by Rishi yadav Vaishali Patel comment Share Follow See all 3 Comments See all 3 3 Comments reply atul_21 commented Jun 25, 2017 reply Follow Share Please explain if u have got it. 0 votes 0 votes Vaishali Patel commented Jun 25, 2017 reply Follow Share S2 is trivially true Bcz for phi the language of machine is empty { } And for S1 there is no mean for L+=L-{€}, it should be L+=L*-{€} and if we consider L*-{€} then it is also false ....As you can understand with this Example .. L={w contains odd no. of a's} and alphabet is (a,b) In this lang. € is not in the lang. Means L is not equal to L* and the ques is for any lang. ...So it is false 5 votes 5 votes dee1pak commented Dec 20, 2017 reply Follow Share I have a doubt, epsilon closure means (E^0 union E^1 union....). So here in L^* means we have input symbol (E) containing the strings of the Language and according to your examples it is infinite (L={w contains odd no. of a's} and alphabet is (a,b)). Is it possible for an input symbol to be infinite? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes i think only statement s1 is true Kaluti answered Jun 25, 2017 Kaluti comment Share Follow See 1 comment See all 1 1 comment reply atul_21 commented Jun 25, 2017 reply Follow Share Answer given is: 4.Both are false 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes both option are wrong abhishekmehta4u answered Mar 15, 2018 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.