# Grammar Induction

Consider the grammar

1) <Number> -> <Digit><Number>|epsilon

2) <Digit> -> 0|1|2|3|4|5|6|7|8|9

Use induction to show that the number of strings in L(<Number>) of length n is equal to 10^n

Â© BrainMass Inc. brainmass.com March 4, 2021, 6:05 pm ad1c9bdddfhttps://brainmass.com/math/basic-algebra/grammar-induction-28275

#### Solution Summary

This is a proof regarding grammar and strings.

$2.19