1,273 views
0 votes
0 votes

1 Answer

0 votes
0 votes

1.set of all formal language mean 2$^{\sum ^{\bigstar }}$ which is Ucountable infinite set.

2.all other are countable set using one to one correspondence to natural number so countable infinite.

ans: A

if u not understand then use CHATGPT  

Related questions

1 votes
1 votes
1 answer
1
atulcse asked Jan 28, 2022
483 views
Which of the following languages is/are regular?
0 votes
0 votes
1 answer
2
Ashish Roy 1 asked Jul 15, 2018
1,135 views
Let L(r1)=(b*ab*ab*ab*)* & L(r2)=(b*ab*ab*)*. What is L(r1) Intersection L(r2)?a) (b*ab*ab*ab*)*b) (b*ab*ab*)*c) (b*ab*ab*)^6d) (b*ab*ab*ab*ab*ab*ab*)*Please do explain a...
2 votes
2 votes
0 answers
3
1 votes
1 votes
1 answer
4
resilientknight asked Aug 2, 2016
746 views
L1 = {apbq | p+q>=106} p,q, can only belong to set N.L1 Regular or not?Complement of L1 is definitely regular,so this should be regular,but it is confusing?