0 votes 0 votes L={W # W | W is in (0+1)* and # is a special symbol} a) L is context free b)L is accepted by turing machine for sure c) L is non cfl ? Theory of Computation made-easy-test-series theory-of-computation context-free-language + – aaru14 asked Nov 16, 2017 edited Mar 4, 2019 by adeebafatima1 aaru14 289 views answer comment Share Follow See 1 comment See all 1 1 comment reply sourav. commented Nov 16, 2017 reply Follow Share $L$ is Context sensative language . Hence both $b$ ,$c$ are right. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes This is infact the terminology for the checking whether variable has been declared before use. For this programming language construct, we need power of Context Sensitive Languages. And surely Turing machines can accept all CSL. Ayush Upadhyaya answered Nov 16, 2017 Ayush Upadhyaya comment Share Follow See all 0 reply Please log in or register to add a comment.