0 votes 0 votes Find two examples of languages that are linear but not deterministic context-free. Theory of Computation peter-linz peter-linz-edition5 theory-of-computation turing-machine recursive-and-recursively-enumerable-languages + – Rishi yadav asked Mar 30, 2019 Rishi yadav 132 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.