I wish we had a term that meant "things like regular expressions, that may not actually define regular languages". A real regular expression can always be tran

I wish we had a term that meant "things like regular expressions, that may not actually define regular languages". A real regular expression can always be translated to a DFA, and be executed in O(len(input)) time. Perl regexpen are not regular.