Register

ACE-BOOKLET-VOL1-CHAPTER1 Question #15 page #54

• edited by
514 views
2 votes
2 votes

Let $\Sigma$ be an alphabet define $L_{\Sigma}$ to be the collection of all infinite languages over $\Sigma$. Then choose the correct from the following:

  1. $L_{\Sigma}$ is closed under complementation
  2. $L_{\Sigma}$ is closed under concatenation
  3. $L_{\Sigma}$ is closed under Kleen closure
  4. None of the above

answer given as B

what is that infinite language?

• edited by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
pC asked Jul 22, 2016
332 views
ACE-BOOKLET-VOL1-CHAPTER1 ( Question #19 page #54)
Question 19 solution given as A Need explanation
Question 19solution given as ANeed explanation
User Avatar
3 votes
3 votes
3 answers
2
pC asked Jul 22, 2016
1,083 views
ACE-BOOKLET-VOL1-CHAPTER1 (questions #14 page #54)
The regular expression denoting all the strings such that every even position occupied by ‘a’ [a+ba]* (a+b+c) b(a)a* + a(a)* ba(b)* aa(b)* aa(b)* aa(a)* Both a and c
The regular expression denoting all the strings such that every even position occupied by ‘a’[a+ba]* (a+b+c)b(a)a* + a(a)*ba(b)* aa(b)* aa(b)* aa(a)*Both a and c
User Avatar
6 votes
6 votes
2 answers
3
pC asked Jul 22, 2016
544 views
ACE-BOOKLET-VOL1-CHAPTER1 (questions #9 page #53)
Question 9 solution is given as
Question 9solution is given as
User Avatar
1 votes
1 votes
1 answer
4
pC asked Jul 21, 2016
525 views
ACE-BOOKLET-VOL1-CHAPTER1 (questions #5, page #53)
Questions 5
Questions 5
User Avatar
Link Copied!