Discrete Structure - Old Questions
Question Answer Details
13. Let G be the grammar with vocabulary V = {S, 0, 1}, set of terminals T= {0, 1}; starting symbol S, and productions P= {S→11s, S→0}. Determine the language L(G) of this grammar.
Answer
AI Generated Answer
AI is thinking...