0 votes 0 votes State true/false:- 1.if L is CSL, then L' is not regular 2.if L is RE, then L' is maybe regular give reason. Theory of Computation theory-of-computation + – Naveen Kumar 3 asked Nov 6, 2018 Naveen Kumar 3 331 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Shaik Masthan commented Nov 6, 2018 reply Follow Share BASIC POINT :- Regular languages closed under Complementation if L is CSL, then L' is not regular every RL is a CSL ==> let L = ∑* which is CSL, then L' = ∅ which is RL. ∴ Given statement is wrong. if L is RE, then L' is maybe regular let L = ∑* which is RE ( due to every Regular Language is a RE ) , then L' = ∅ which is RL. ∴ Given statement is TRUE. 2 votes 2 votes Naveen Kumar 3 commented Nov 6, 2018 reply Follow Share for 1st part , i assumed "if L is CSL, it may not be RL". 0 votes 0 votes Shaik Masthan commented Nov 6, 2018 reply Follow Share if there exist atleast one counter example, then given statement is False. i given such an counter example for that statement 1 votes 1 votes Naveen Kumar 3 commented Nov 6, 2018 reply Follow Share so, for 1st part L' may or may not be regular. true? 0 votes 0 votes Shaik Masthan commented Nov 6, 2018 reply Follow Share yes. If the statement is like if L is CSL but not RL, then L' is not regular then it is TRUE 1 votes 1 votes Please log in or register to add a comment.