Question $2$

Select the following statements that are considered true:

The empty set and empty string are considered the same.

The union of two regular languages is regular.

Not all DFAs are considered an NFA.

Every NFA is considered a DFA.

Grammars will recognize all members of a language.

All regular languages are accepted by a DFA.

DFAs and NFAs can have no final states.

The intersection of two regular languages is regular.

All DFAs and NFAs are required to have at least one final state.

The concatenation of two regular languages is regular.

Every NFA has an equivalent DFA.

Lambda $($or epsilon$)$ transitions are allowed in a DFA.

A DFA can have multiple start states.