0 0 votes Is subset of regular language is always recursively enumerable language? Theory of Computation + – Warrior 825 views answer comment Share Follow Print See all 5 Comments 5 5 Comments reply Show 2 previous comments Mizuki commented Jan 10, 2019 reply Follow flag @arvin can you elaborate? 0 0 replyShare arvin commented Jan 11, 2019 reply Follow flag just made it easy : //empty language will be subset of every regular language whether countably finite or infinite so we can count this... recursive + recursive enumerable... but considering subset of complete language (a+b)* will be countably infinite //like you said one one correspondence... and it will fail at some point so its not closed under decidability... 1 1 replyShare Mizuki commented Jan 11, 2019 reply Follow flag Thanks @arvin! 1 1 replyShare Please log in or register to add a comment.
