All finite languages can be decribed using a regular expression?

Question

I have a question. All finite languages can be decribed using a regular expression?

What do you think? Have you tried proving this or looking for a counterexample? — roctothorpe, Apr 07 '18 at 01:44

score 1 · Accepted Answer · answered Apr 07 '18 at 02:08

1

Suppose that a finite language consists of words $w_1, w_2, \dots, w_n$.

Then what do you think the regular expression ^(w1 | w2 | ... | wn)$ matches?

answered Apr 07 '18 at 02:08

orlp

ohhh i see... But that expression say nothing about the generation of the words on the language... but this is another point. – kevin parra Apr 08 '18 at 12:16

1 Answers1