Next: Regular Expressions in Formal
Up: Appendix: Regular Expressions
Previous: Appendix: Regular Expressions
  Contents
The origin of regular expressions lies in automata theory and formal language theory
(both part of theoretical computer science). These fields study models of computation
(automata) and ways to describe and classify formal languages. A formal language
is nothing but a set of strings. In the 1940s, Warren McCulloch and Walter Pitts described the
nervous system by modelling neurons as small simple automata. The mathematician, Stephen
Kleene, later described these models using his mathematical notation called regular sets.
Ken Thompson built this notation into the editor qed, then into the Unix editor ed and
eventually into grep. Ever since that time, regular expressions have been widely used in Unix
and Unix-like utilities.
Andre Merzky
2004-05-13
|