Lecture A/5: Finite Automata and Regular Languages

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.