Question: 4. (a) Construct regular grammars for the following languages: i. L= (00* (01+0)*). ii. L= {W {0,1}* | Difference between No. of O's and ls

4. (a) Construct regular grammars for the following languages: i. L= (00* (01+0)*). ii. L= {W {0,1}* | Difference between No. of O's and ls is odd } (b) Argue that if a regular language L does not have I then it can always be generated by a regular grammar without any \-rules that is rules of the form X + 1, where X is a non-terminal
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
