I have a simple grammar as below and wonder if it is convertible to regular grammar?
If yes, what is the conversion sequence? If no, how can we prove it?
S -> A A -> aAA | b | c
In which S is the start symbol; A is non-terminal; a b c are terminals.
Any help or suggestion is appreciated.