Answer to Question #37755 in Math for Sujata Roy

Question #37755

The language L={0^n 1^n 2^R 3^R where n.k>0} is a:

a) context-sensitive language
b) context-free language
c) regular language
d) recursively enumerable language

Expert's answer

Answer in progress...

Learn more about our help with Assignments: Math

Comments

No comments. Be the first!

Leave a comment

Related Questions

1. A one-dimensional cellular automaton is seeded (initialized) with the following values at time t0. .
2. Given the following rule for the evolution of a cellular automation (a - 1'a1') + (a0 a1&#
3. There are two strain of flu(F) virus and two types of vaccine. The first vaccine(V1), is 0.85 effect
4. Please apply the gradient form of the Karush-Kuhn-Tucker (KKT) theorem to minimize the function f(x,
5. L = Lagrangian. If, for a given vector x* in C, there is lamda* >= 0 such that L(x*,lamda*) <
6. Matrix Games: If we are given an arbitrary I by J matrix A, there exists a greater than 0 so that t
7. Let p: R^J-->R be sub-linear, and p(-x_n) = -p(x_n) for n = 1,2,...,N. Show that p is linear on t