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
3.35 Rating (155 Votes )
There are 3 Steps involved in it
Proof We prove this by induction on b Base Case b 1 Suppose G is a CFG in Chomsky normal form with o... View full answer
Get step-by-step solutions from verified subject matter experts
