Can you help with a contex-free grammar for the language 0^n 1^m 2^k where n + 2k >= m?
Asked
Active
Viewed 37 times
-2
-
3Does this answer your question? How to prove that a language is context-free? – Nathaniel Jun 19 '21 at 18:12
1 Answers
0
Hint: The language is the same as $0^i 0^n 1^n (11)^k 2^k 2^j$. If I made no mistakes. Which is up to you to check. And yes, there’s a tiny mistake.
gnasher729
- 29,996
- 34
- 54