Regular Languages
Regular languages and languages that a computer can recognize with only a finite amount of memory and no backtracking. They correspond to right linear grammars.
Videos
Further Reading
- Regular Expression Crossword Puzzle
- Regular Expression Matching Can be Simple and Fast Surprisingly, many programming languages do regex matching wrong.