regular languages

(60 minutes to learn)


A regular language is a formal language which can be defined using a regular expression. Equivalently, it is a language definable as the set of strings accepted by some finite automaton, either deterministic or nondeterministic.


This concept has the prerequisites:


  • Show that regular expressions and finite automata define the same sets of languages
  • Be able to show that languages are not regular (e.g. using the Pumping Lemma)
  • Prove the Pumping Lemma

Core resources (read/watch one of the following)



See also

-No Additional Notes-