Question

Gr 114 D. Con vert the given grammar to an equivalent non-deterministic finite automata. 31. The grammar in Exercise 26. 32. The grammar in Exercise 28. 33. The grammar in Exercise 29. 34. The grammar in Exercise 30. E. The following grammar is not regular. Convert it to an equiva lent regular grammar. What h the language of the grammar? E. The following regular grammars are incorrect. Debug and correct them. 37. Binary numbers divisible by 4: 38. Strings with any numbers of 0, 1, and 2 in that order

Solve the E question..

Answer 1

こ611 01, 1,011, l}, σ 11 1))I-3 S oin ab, ke, ab, absa, abab, ab ba, ab -J a b, ba, asso, asas