• Generally, it's easier to find a NFA to accept a given language, but easier to program a DFA.
• It is asserted that both FDAs and NFAs recognise the regular languages, which themselves are represented by regular expressions.

A Regular grammar is on e where each production takes on fo the following restricted forms:

• $N \to \Lambda$
• $N \to w$
• $N \to A$
• $N \to wA$