Option c is right
-
if a language is regular then there must exist a left linear and right linear grammar .so option a and b is true .
Example : L= a*
Left linear grammar is : s--->aS/null
Right linear grammar is: s---->Sa/null
-
In NFA if there is multiple final state then we can make it single final state . But not in DFA .
-
If a language is regular then there exist a NFA . AND NFA WITH NULL IS EQUIVALENT TO NFA . BECZ CONVERSION IS POSSIBLE . SO OPTION e is also true .