Question $2$

$0\mathrm{.}17/1$ pts

Select the following statements that are considered true:

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

A DFA can have multiple start states.

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

The concatenation of two regular languages is regular.

The empty set and empty string are considered the same.

The union of two regular languages is regular.

DFAs and NFAs can have no final states.

The intersection of two regular languages is regular.

All regular languages are accepted by a DFA.

Not all DFAs are considered an NFA.

Grammars will recognize all members of a language.

Every NFA is considered a DFA.

Every NFA has an equivalent DFA.