Question

1. Grammars that can be translated to DFAs:
a.Left linear grammar
b.Right linear grammar
c. Generic grammar
d. All of these​

Answer 1

Answer:

right liner grammar

Step-by-step explanation:

A language is regular if and only if it is accepted by finite automata. Explanation: Regular Language is accepted by Finite Automata.