Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by DukeThunders
1
answer
1
Doubt regarding countable and uncountable sets
Hello, I have read that Σ* is countably infinite and power set of Σ* (ie. 2^ Σ*) is uncountably infinite. So by Cantor’s theorem, power set of any countably infinite set is uncountably infinite. Then what can be said about 0^any countably infinite set or 3^any countably infinite set? Do these things have any significance? Thank you.
Hello,I have read that Σ* is countably infinite and power set of Σ* (ie. 2^ Σ*) is uncountably infinite.So by Cantor’s theorem, power set of any countably infinite s...
554
views
commented
Jun 11, 2019
Theory of Computation
theory-of-computation
countable-uncountable
+
–
2
answers
2
Theory of Computation: Context Free Languages
Hi, I am having a doubt understanding the result of CFL - Regular: Here's my approach: CFL - Regular = CFL INTERSECTION Regular' = CFL INTERSECTION Regular = CFL Suppose some CFL L1= {a^n b^n | n>=1} and some Regular R1= (a+b)* ... to say CFL - Regular = Regular or CFL - Regular = CFL ? If both are separate options, which one should I go for? Thanks
Hi, I am having a doubt understanding the result of CFL – Regular:Here’s my approach:CFL – Regular = CFL INTERSECTION Regular’ = CFL INTERSECTION Regular = CFLSup...
406
views
asked
Jun 9, 2019
Theory of Computation
theory-of-computation
context-free-language
self-doubt
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register