1 votes 1 votes L = { ap | P is NOT Prime } - How to prove is it CFL or NOT? Theory of Computation theory-of-computation + – pps121 asked Nov 30, 2016 pps121 401 views answer comment Share Follow See 1 comment See all 1 1 comment reply thor commented Nov 30, 2016 reply Follow Share Just remember it that it is a CSL. No proof required !!! 1 votes 1 votes Please log in or register to add a comment.
1 votes 1 votes L1: {a*}. Regular L2: {ap , P is prime}. CSL L= L1-L2 => L1 intersection L2' => Regular intersection CSL =>CSL akashsheoran answered Nov 30, 2016 akashsheoran comment Share Follow See all 0 reply Please log in or register to add a comment.