Topic: Discrete Mathematics and its Applications(2012) Chapter 13 Modeling Computation "Languages and Grammars"

Variation on 13.1#5] Let G = (V, T, S, P) be the phrase-structure grammar with V = { 0,1, A, B,S}, T = { 0,1}, and set of productions P consisting of 1, (a) Generate the six shortest strings in the language generated by G. (b) Find the shortest string(s) not belonging in the language generated by G (c) What is the total number of strings of length n in the language generated by G