Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged countable-uncountable-set
0
votes
1
answer
1
Countable Sets Self Doubt
Is countable sets part of GATE CS 2024 syllabus?
Is countable sets part of GATE CS 2024 syllabus?
prasoon054
164
views
prasoon054
asked
Dec 7, 2023
Theory of Computation
theory-of-computation
countable-uncountable-set
+
–
1
votes
1
answer
2
TIFR CSE 2022 | Part A | Question: 3
A binary string is a sequence of $0 \text{'s}$ and $1\text{'s}.$ A binary string is finite if the sequence is finite, otherwise it is infinite. Examples of finite binary strings include $00010100$, and $1111101010.$ ... set of all finite binary strings is countable while whether the set of all infinite binary strings is countable or not is not known
A binary string is a sequence of $0 \text{'s}$ and $1\text{'s}.$ A binary string is finite if the sequence is finite, otherwise it is infinite. Examples of finite binary ...
admin
599
views
admin
asked
Sep 1, 2022
Theory of Computation
tifr2022
theory-of-computation
countable-uncountable-set
+
–
0
votes
0
answers
3
Michael Sipser Edition 3 Exercise 4 Question 9 (Page No. 211)
Review the way that we define sets to be the same size in Definition $4.12$ (page $203$). Show that “is the same size” is an equivalence relation.
Review the way that we define sets to be the same size in Definition $4.12$ (page $203$). Show that “is the same size” is an equivalence relation.
admin
414
views
admin
asked
Oct 17, 2019
Theory of Computation
michael-sipser
theory-of-computation
turing-machine
countable-uncountable-set
proof
+
–
0
votes
0
answers
4
Michael Sipser Edition 3 Exercise 4 Question 8 (Page No. 211)
Let $T = \{(i, j, k)\mid i, j, k \in N \}$. Show that $T$ is countable.
Let $T = \{(i, j, k)\mid i, j, k \in N \}$. Show that $T$ is countable.
admin
477
views
admin
asked
Oct 17, 2019
Theory of Computation
michael-sipser
theory-of-computation
turing-machine
countable-uncountable-set
proof
+
–
35
votes
4
answers
5
GATE CSE 2019 | Question: 34
Consider the following sets: S1: Set of all recursively enumerable languages over the alphabet $\{0, 1\}$ S2: Set of all syntactically valid C programs S3: Set of all languages over the alphabet $\{0,1\}$ S4: Set of all non-regular languages over the alphabet $\{ 0,1 \}$ Which of the above sets are uncountable? S1 and S2 S3 and S4 S2 and S3 S1 and S4
Consider the following sets:S1: Set of all recursively enumerable languages over the alphabet $\{0, 1\}$S2: Set of all syntactically valid C programsS3: Set of all langua...
Arjun
13.0k
views
Arjun
asked
Feb 7, 2019
Theory of Computation
gatecse-2019
theory-of-computation
countable-uncountable-set
2-marks
+
–
2
votes
2
answers
6
GATE Overflow | Mock GATE | Test 1 | Question: 46
Which of the following statements is/are not correct? (P) The class of all Turing Machines is countably infinite (Q) The class of all DCFL's is countably infinite (R) The class of all formal languages is uncountably infinite (S) The set of all primes is countably infinite Only R Only R and S All are incorrect except P None of the above
Which of the following statements is/are not correct?(P) The class of all Turing Machines is countably infinite(Q) The class of all DCFL's is countably infinite(R) The cl...
Ruturaj Mohanty
3.2k
views
Ruturaj Mohanty
asked
Dec 27, 2018
Theory of Computation
go-mockgate-1
countable-uncountable-set
theory-of-computation
+
–
1
votes
3
answers
7
doubt
How to check any set is countable or not
How to check any set is countable or not
bhavnakumrawat5
426
views
bhavnakumrawat5
asked
Sep 30, 2018
Theory of Computation
countable-uncountable-set
+
–
0
votes
1
answer
8
countability
whether the given sets countable or uncountable? 1. the set of all finite partitions of N 2. the set of all non-increasing functions from N to N. 3. the set of all non-decreasing functions from N to N. here, N is natural numbers. please give answer with proper explanation, as i already have one word answer for all of the problems above.
whether the given sets countable or uncountable?1. the set of all finite partitions of N2. the set of all non-increasing functions from N to N.3. the set of all non-decre...
aambazinga
791
views
aambazinga
asked
Sep 20, 2018
Theory of Computation
theory-of-computation
countable-uncountable-set
+
–
2
votes
1
answer
9
Countable and Uncountable Self Doubt 2
Which of the following is always correct? A. Cross product of two countable set is countable B. Cross product of two countable set is uncountable C. Cross product of two uncountable set is countable D. Cross product of uncountable ... E. Cross product of uncountable and countable set is countable F. Cross product of uncountable and countable set is uncountable
Which of the following is always correct?A. Cross product of two countable set is countableB. Cross product of two countable set is uncountableC. Cross product of two unc...
smsubham
787
views
smsubham
asked
Sep 11, 2018
Set Theory & Algebra
theory-of-computation
countable-uncountable-set
set-theory&algebra
+
–
3
votes
0
answers
10
Countable and uncountable Self Doubt 1
which of the following is always correct? A. Union of two uncountable set is uncountable B. The intersection of two uncountable set is uncountable C. Union of two uncountable set is countable D. The intersection of two uncountable set is ... is countable I. The complement of a countable set is countable. J. The complement of a countable set is uncountable.
which of the following is always correct?A. Union of two uncountable set is uncountableB. The intersection of two uncountable set is uncountableC. Union of two uncountabl...
smsubham
1.7k
views
smsubham
asked
Sep 11, 2018
Set Theory & Algebra
countable-uncountable-set
theory-of-computation
set-theory&algebra
+
–
1
votes
0
answers
11
Countability and Well Ordering
Is there any relation between countability and well ordering? I mean if a set is well ordered, does it have any influence on it being countable and vice versa?
Is there any relation between countability and well ordering? I mean if a set is well ordered, does it have any influence on it being countable and vice versa?
Lakshay Kakkar
453
views
Lakshay Kakkar
asked
Aug 19, 2018
Set Theory & Algebra
countable-uncountable-set
+
–
0
votes
0
answers
12
Countable uncountable functions
How the set of all non-decreasing functions from N to N are countable? How the set of all finite partitions of N are uncountable?
How the set of all non-decreasing functions from N to N are countable?How the set of all finite partitions of N are uncountable?
aambazinga
802
views
aambazinga
asked
Jul 15, 2018
Theory of Computation
theory-of-computation
countable-uncountable-set
+
–
52
votes
6
answers
13
GATE CSE 2018 | Question: 27
Let $N$ be the set of natural numbers. Consider the following sets, $P:$ Set of Rational numbers (positive and negative) $Q:$ Set of functions from $\{0,1\}$ to $N$ $R:$ Set of functions from $N$ to $\{0, 1\}$ $S:$ Set of finite subsets of $N$ Which of the above sets are countable? $Q$ and $S$ only $P$ and $S$ only $P$ and $R$ only $P, Q$ and $S$ only
Let $N$ be the set of natural numbers. Consider the following sets,$P:$ Set of Rational numbers (positive and negative)$Q:$ Set of functions from $\{0,1\}$ to $N$$R:$ Set...
gatecse
21.7k
views
gatecse
asked
Feb 14, 2018
Set Theory & Algebra
gatecse-2018
set-theory&algebra
countable-uncountable-set
normal
2-marks
+
–
1
votes
1
answer
14
MadeEasy Test Series 2018: Theory Of Computation - Countable Set
Rishi yadav
398
views
Rishi yadav
asked
Jan 4, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
countable-uncountable-set
+
–
4
votes
1
answer
15
Test by Bikram | Mock GATE | Test 4 | Question: 17
Let the set of all natural numbers be $N$. Which of the following are countable sets? The set of all functions from $N$ to $\{0, 1\}$ The set of all functions from $\{0, 1\}$ to $N$ The largest subset of $N$ I, II, and III I and II only II and III only I and III only
Let the set of all natural numbers be $N$. Which of the following are countable sets? The set of all functions from $N$ to $\{0, 1\}$ The set of all functions from $\{0,...
Bikram
432
views
Bikram
asked
May 14, 2017
Set Theory & Algebra
tbb-mockgate-4
discrete-mathematics
set-theory&algebra
set-theory
countable-uncountable-set
+
–
0
votes
1
answer
16
theory of computation
Consider the following statements. S1 : union of any finite number of countable sets is countable. S2 : union of infinite number of countable sets is countable S3 : cross product of any finite number of countable sets is countable. S4 : cross product of infinite number of countable sets is ... A) Only S1 B) Only S1) and S3) C) Only S1),S2),S3) D) All of S1),S2),S3),S4)
Consider the following statements.S1 : union of any finite number of countable sets is countable.S2 : union of infinite number of countable sets is countable S3 : cross p...
vignesh
479
views
vignesh
asked
Apr 23, 2017
Theory of Computation
theory-of-computation
countable-uncountable-set
+
–
0
votes
1
answer
17
Countable and recursive language relation
Is every countable language recursive enumerable?
Is every countable language recursive enumerable?
Purple
570
views
Purple
asked
Jan 27, 2017
Theory of Computation
theory-of-computation
recursive-and-recursively-enumerable-languages
countable-uncountable-set
+
–
0
votes
1
answer
18
Contable and UnCountable sets!
smartmeet
1.8k
views
smartmeet
asked
Jan 12, 2017
Theory of Computation
set-theory&algebra
theory-of-computation
countable-uncountable-set
regular-language
+
–
0
votes
1
answer
19
Gate Practice questions
If the set of all words over alphabet S is countable then Any language over S must be finite. at least one language over must be uncountable. any language over S is countable. each language over S is finite
If the set of all words over alphabet S is countable thenAny language over S must be finite.at least one language over must be uncountable.any language over S is countabl...
Ravi_1511
543
views
Ravi_1511
asked
Nov 8, 2016
Theory of Computation
countable-uncountable-set
theory-of-computation
+
–
1
votes
1
answer
20
Set Concept
Why it is that if we can list the element of set in a sequence then it is countable? I mean how it can be a necessary and sufficient condition for a set to be Countable.Because we can provide sequence no to any set.Cann't we?And how can an infinity set be countable, as it is already infinity?
Why it is that if we can list the element of set in a sequence then it is countable? I mean how it can be a necessary and sufficient condition for a set to be Countable....
Sarvottam Patel
521
views
Sarvottam Patel
asked
Jul 27, 2016
Set Theory & Algebra
set-theory
countable-uncountable-set
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register