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.

Welcome to Computer Science! What have you tried? Where did you get stuck? We do not want to just hand you the solution; we want you to gain understanding. However, as it is we do not know what your underlying problem is, so we can not begin to help. See here for tips on asking questions about exercise problems. If you are uncertain how to improve your question, why not ask around in [chat]? — Raphael, Jun 05 '17 at 21:25

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

${w | w \in L \text{ and } w \text{ starts with } abc } = L \cap abc(a|b|c)^*$. And regular languages are closed under intersection. Am I right? – fornit Jun 05 '17 at 21:21
Right, that's the simplest proof. – Yuval Filmus Jun 05 '17 at 21:40

1 Answers1