0 votes 0 votes The language L = { an bm ck : k = | n − m | } is a Non-deterministic CFL right ??? Theory of Computation theory-of-computation context-free-language + – Vicky rix asked Apr 5, 2017 retagged Jul 4, 2017 by Arjun Vicky rix 200 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes plz make me correct if I m wrong... akash.dinkar12 answered Apr 5, 2017 selected Apr 5, 2017 by Vicky rix akash.dinkar12 comment Share Follow See all 0 reply Please log in or register to add a comment.