1 votes 1 votes Complement of non regular language is regular or not? Theory of Computation finite-automata regular-language + – PRASHANT YADAV asked Jul 8, 2017 PRASHANT YADAV 335 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes The family of regular languages is closed under complementation. The family of Deterministic context-free languages is closed under complementation. The family of Non-deterministic context-free languages is not closed under complementation. The family of Recursive languages is closed under complementation. The family of Recursive Enumerable Sets is not closed under complementation. Check this: http://gatecse.in/closure-property-of-language-families/ Hemant Parihar answered Jul 8, 2017 Hemant Parihar comment Share Follow See all 0 reply Please log in or register to add a comment.
