LANGUAGES, REGULAR EXPRESSIONS, BNF GRAMMARS, FINITE

( = {a, b, c} V={S, A, B} S(bB | aΑ . A(aS | a . B(bS | b. The language generated is (aa ( bb)+. ( = {a, b, c} V={S, M, F} S ( bS | aM . M ( bS | aF. F ( bF | aF | (The language generated is the set of all words containing the substring aa, that is the language of the regular expression (a ( b)* aa(a ( b)*. ................
................