For each of the given grammars, determine whether they are regular as grammars (not the corresponding language). (a) S→aS∣Λ (b) S→aSb∣Λ (c) S→aS∣∧∣T T→bT∣Λ (d) S→Λ∣abs∣aTBc T→abC∣aTBC CB→CX→BX→BC b→bb Cc→cc. Show that the following language is not regular by using the Pumping Lemma: {anban∣n∈N}.

Answer :

Other Questions