Hacker News new | ask | show | jobs
by nahumfarchi 575 days ago
Yes, all finite languages are regular.

Specifically, you can construct a finite automata to represent it.