This question already has an answer here:
I have the following problem to solve:
Show that if G is a context-free grammar and Σ consists of just one terminal symbol, then L(G) is regular.
It is problem 4.26 from the book "Formal models of computation" by Arthur Fleck.
Do you have any ideas or solutions?