This is an old revision of the document!
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.
Lecture A/6: What is beyond regular languages?
A Regular grammar is on e where each production takes on fo the following restricted forms:
- $N \arrowright \Lambda$
- $N \arrowright w$
- $N \arrowright A$
- $N \arrowright wA$