Recent content by Studente

Hi, could you please describe the language generated by this grammar? S -> A | Bbb A -> aB B -> aBb | ? e.g. L={a^n b^m etc.. or the equivalent regular expression Thanks Thanks a lot, could you please help me with this variant? S -> A | Bbb A -> aB B -> aAb | ?