A Language is said to be regular iff
(a) There exists a Right Linear Regular Grammar for L
(b) There exists a Left Linear Regular Grammar for L
(c) There exists a nfa with single final state
(d) There exists a dfa with single final state
(e) There exists a nfa without ԑ - move
Which are true?
(i) All are true (b) a, b, c are true
(c) a, b, c, e are true (d) a, b, d are true