Question: Consider the context free grammar G with = {a, b} and rules S aSb | bSa | a | b. How many strings in L(G)
Consider the context free grammar G with = {a, b} and rules S aSb | bSa | a | b. How many strings in L(G) are of length less than or equal to 11? Hint: the answer involves the sum of a geometric progression.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
