Answer to Question #38640 in Math for Sujata Roy

Question #38640

The language {w| w is the set of all balanced parenthesis} is
A. regular
B. context-free but regular
C. context-sensitive but not context-free
D.type-0 but not context-sensitive

Expert's answer

Download Answer

Learn more about our help with Assignments: Math

Comments

No comments. Be the first!

Leave a comment

Related Questions

1. The language {w| w in {0,1}* and w does not have three consecutive 0′s} is A. regular B. context-f
2. {w| w has equal number of a’s and b’s } is A. regular B. context-free but regular C. context-sen
3. The intersection of two cfls can simulate a turing machine computation. We are given two cfls L1 and
4. We are given an arbitrary turing machine M and define the language L as below L=(0*+1*)* if M halts
5. We are given two context-free languages L1 and L2 and L defined as below a) L=(0+1)* if L1=L2 b) L=(
6. Nobody knows if P=NP at present. Consider a language L as defined below L=(0+1)* if satisfiability i
7. An arbitrary turing machine M will be given to you and we define a language L as follows L=(0+00)* i