0 votes 0 votes A Turing Machine accepts a language if its DCFL but rejects if it's a non deterministic CFL Theory of Computation decidability theory-of-computation + – Mk Utkarsh asked Sep 15, 2018 Mk Utkarsh 566 views answer comment Share Follow See 1 comment See all 1 1 comment reply Mk Utkarsh commented Sep 15, 2018 reply Follow Share Here's my understanding and please point out if i'm misunderstanding anything A Turing Machine accepts a language if its DCFL but rejects if it's a non deterministic CFL. This means that this TM is able to decide CFL's but there exists a TM which can decide CFL's and there exist a TM which can decide only Regular languages hence this is not a trivial property of TM. So it is undecidable. 0 votes 0 votes Please log in or register to add a comment.
