Equivalent to what is recognized by a regular grammar and a DFA.

Definition:

• languages consisting only of a single terminal are regular.

• set union of two regular languages is regular.

• concatenation of two regular languages is regular. Concatenation of sets of strings is concatenating each pair of strings in the set.

• Kleene star. Infinite concatenations with itself.