2 votes 2 votes $L = a^nb^nc^n$. complement of $L$? regular cfl csl recursive Theory of Computation theory-of-computation + – satyam132 asked Mar 30, 2018 • edited Mar 30, 2018 by Sukanya Das satyam132 320 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Sukanya Das commented Mar 30, 2018 reply Follow Share are you want to mean $a^nb^nc^n$? 1 votes 1 votes Sukanya Das commented Mar 30, 2018 reply Follow Share if the language is$a^nb^nc^n$, then complement of this should be CFL, & can be accepted by a NPDA 0 votes 0 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes B) CFL complement of L IS CFL and hence it is also CSL and RECURSIVE. but strongest answer will be CFL. abhishekmehta4u answered Mar 30, 2018 • selected Mar 30, 2018 by satyam132 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.
