Regular Expression in formal language theory sense can be represented as FSM's. Many real world string pattern matching engines (regexes) implement features t

Regular Expression in formal language theory sense can be represented as FSM's. Many real world string pattern matching engines (regexes) implement features that can't be expressed using regular languages. Backreferences or any context sensitive extensions are not really regal expressions in that sense.