Problem 1 Design context-free grammars for the following languages: a) The set {

Question

Problem 1 Design context-free grammars for the following languages: a) The set {0^n 1^n}, that is, the set of all strings of one or more 0's followed by an equal number of 1's. b) The set {a^I b^I c^k|i not equal to j or j not equal to k}, that is, the set of strings of a's followed by b's followed by c's, such that there are either a different number of a's and b's different number of b's and c's, or both. c) The set of strings over 0 and 1 that start and end with the same symbol. d) The set of strings over 0 and 1 with odd length. e) The set of all strings with twice as many 0's as 1's.

Explanation / Answer

For question b) - https://drive.google.com/file/d/0B3lVit8k3iPqa3lla0tQR3ZXRzA/view?usp=sharing

https://drive.google.com/file/d/0B3lVit8k3iPqRVZTOF9VX0RYX3M/view?usp=sharing

https://drive.google.com/file/d/0B3lVit8k3iPqWkVhTnhZNGgzdk0/view?usp=sharing

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.