1 votes 1 votes Theory of Computation made-easy-test-series theory-of-computation identify-class-language + – vaishali jhalani asked Jan 25, 2017 • edited Mar 5, 2019 by adeebafatima1 vaishali jhalani 253 views answer comment Share Follow See 1 comment See all 1 1 comment reply focus _GATE commented Jan 25, 2017 reply Follow Share given language is regular so all S1 S2 S3 S4 are true so (d) option is true 0 votes 0 votes Please log in or register to add a comment.
Best answer 0 votes 0 votes The language is regular!! thats it , solves the problem , regular languages are closed under, complement so L1' is also regular from chomsky hierarchy it is CFL,CSL,Recursive,RE , whatever you say Aboveallplayer answered Jan 25, 2017 • selected Jan 28, 2017 by Sushant Gokhale Aboveallplayer comment Share Follow See all 0 reply Please log in or register to add a comment.
