Answer to Question #38643 in Math for Sujata Roy

Question #38643

The language {a^i b^j c^k| i=j or j=k} is
A. regular but not finite
B. deterministic context-free but not regular
C. context-sensitive but not regular
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 languge {w| w has equal number of a’s,b’s, c’s or equal number a’s, b’s and d’s} is
2. The set {0,1,#}+-{b1#b2#…#bn|n>=1} where bi is the binary representation of i is A. regular B.
3. The language {w| w is the set of all balanced parenthesis} is A. regular B. context-free but regular
4. The language {w| w in {0,1}* and w does not have three consecutive 0′s} is A. regular B. context-f
5. {w| w has equal number of a’s and b’s } is A. regular B. context-free but regular C. context-sen
6. The intersection of two cfls can simulate a turing machine computation. We are given two cfls L1 and
7. We are given an arbitrary turing machine M and define the language L as below L=(0*+1*)* if M halts