0 votes 0 votes Is the language $L =$ {$a^nb^m : n = m$ or $n = m + 2$} deterministic? Theory of Computation peter-linz peter-linz-edition4 theory-of-computation context-free-language + – Naveen Kumar 3 asked Jun 23, 2019 Naveen Kumar 3 235 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply shivanisrivarshini commented Jun 23, 2019 reply Follow Share NO 0 votes 0 votes Ashwani Kumar 2 commented Jun 23, 2019 reply Follow Share Non deterministic CFL 0 votes 0 votes Please log in or register to add a comment.