How to prove the words in a regular language that start with abc constitute a regular language

Question

Let $L$ be a regular language with alphabet $\Sigma = \{a,b,c\}$.

Prove that the following language is regular:

$\{w | w \in L \text{ and } w \text{ starts with } abc \}$.

I wonder what proof strategy I can use to prove this.

score 2 · Answer 1 · answered Jun 05 '17 at 20:58

2

Use closure properties of regular languages.

answered Jun 05 '17 at 20:58

Yuval Filmus

1 Answers1