notes

Personal notes
git clone git://git.laack.co/notes.git
Log | Files | Refs

RegularLanguages.md (229B)

      1 # Regular Languages 
      2 
      3 **Source:** Theory of Computation
      4 
      5 **Lecture:** 1
      6 
      7 **Definition:** A language is a regular language if there exists a finite automaton that recognizes it (ie. the FA's language is the language in question).