Turing complete
The standard regular expressions, which most programming languages use, are not Turing complete. This is because regular expression engines have been adapted to include back-references, and a finite automaton cannot handle back references.