This question already has an answer here:
- How to prove a language is regular? 8 answers
In order to prove that the following language is regular, would I use a pumping lemma?
The set $A$ of all strings that are substrings of some string in $L$, where $L \subseteq\Sigma^*$. $L$ Must be regular.