A NFA to a Regular Grammar
1. Define: Right-Linear Grammar
2. Consider the grammar G = (S, T, V, P) with production rules
S aA
A aaA |
(a) Construct a DFA that accepts/recognizes, strings derived from the grammar G with production rules
(b) What is the language L = L (G) defined by the above grammar G?
(c) What is a regular expression describes the grammar G?
Explain me every question please