685 views
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 )

  1.  S1,S2
  2.  Only S1
  3.  Only S2
  4.  Both the statements are false
     

3 Answers

Best answer
1 votes
1 votes
4.both are false
selected by
0 votes
0 votes
i think only statement s1 is true

Related questions

0 votes
0 votes
1 answer
1
Anirban Biswas asked Jan 8, 2017
400 views
If L={ambn | m,n≥1 & gcd(m,n)=1}, then L is Context sensitive Language Context-free Language Regular Language None of the above
0 votes
0 votes
2 answers
2
0 votes
0 votes
1 answer
4
Deepak9000 asked Nov 27, 2023
201 views
Why is C is regular as it non regular as?Please help me with this confusion