0

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

kevin parra
  • 103
  • 3

1 Answers1

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?

orlp
  • 13,988
  • 1
  • 26
  • 41