NotesByLex

Regular Language

A Language is called a Regular Language if a Finite Automaton recognises it.