Answered You can hire a professional tutor to get the answer.
QUESTION
Construct grammars generating the following languages. (i) Language L consists of all strings over alphabet {0,1} of form 0^i, 1^j, where i !
Construct grammars generating the following languages.
(i) Language L consists of all strings over alphabet {0,1} of form 0^i, 1^j, where i != j
(ii) Language M consists of all strings over the alphabet {0,1} of form 0^n 10^n 1, where n >= 0.
