1. Give a RIGHT-LINEAR GRAMMAR to generate each of the following languages: (a) The language that can be generated by the regular expression (0+1)*000+00+1). (b) All strings over (0, 1,.. 9 such that the final digit has not appeared before. Show transcribed image text 1. Give a RIGHT-LINEAR GRAMMAR to generate each of the following languages: (a) The language that can be generated by the regular expression (0+1)*000+00+1). (b) All strings over (0, 1,.. 9 such
OR
OR