Question: Let G be a CFG in Chomsky normal form that contains b variables. Show that if G generates some string with a derivation having at
Let G be a CFG in Chomsky normal form that contains b variables. Show that if G generates some string with a derivation having at least 2b steps, L(G) is infinite.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
