Prove that a finite language is regular I want to prove that $L(G) = \{01; 11110; 10101; 000\}$ is regular.

Is it correct if I write there exists a regular expression, which is: $(01|11110|10101|000)$?

How can I also prove it using a DFA?
The regular expression is correct.

You can use a trie-like structure, i.e.