4. Consider the following CFG. Prove using induction that nostring in this language has ba as a substring.
Terminals: {a,b}
Starting: S
S→aS | Sb | a | b
Expert Answer
An answer will be send to you shortly. . . . .
4. Consider the following CFG. Prove using induction that nostring in this language has ba as a substring.
Terminals: {a,b}
Starting: S
S→aS | Sb | a | b
An answer will be send to you shortly. . . . .