Problem 2 Given below are some categories of languages. (R) Regular Languages (C) Context Free Languages (D) Decidable L

[answerhappygod]

Problem 2 Given Below Are Some Categories Of Languages R Regular Languages C Context Free Languages D Decidable L 1 (96.41 KiB) Viewed 49 times

Problem 2 Given below are some categories of languages. (R) Regular Languages (C) Context Free Languages (D) Decidable Languages (T) Recognizable Languages (L) All Languages Classify each the languages below into the provably belong. Each correct answer is 1 point. allest category (from above) that they [20 points) (1) Language L such that L is not context free. (2) Language L such that I is recognizable. (3) L = {(M)| M is a Turing Machine such that E EL(M)}. (4) L = {w3x, z, such that w EG and xyz € R} where G is a context-free Inguage and R is a regular language. (5) Let L = {(M)| M is a Turing machine that accepts at least 42 strings }. (6) L such that I < ATM, where Atm = {(M,w) | M accepts w}. (7) QueensPath = {{n, s, t) | there exists a sequence of Queen moves on an n x n chess board from the square s to the square t} (8) L = {y | 3:6, 7, such that xyz € R} where R is a regular language. = (9) L = {(M) M is a Turing Machine that does not halt on at least one string}. (10) Language L such that L, CL CL, where L1 and Lare decidable.