Evidently, given an FSRA A, it can be verified in polynomial time that A is linearized.
we now introduce new regular expression operators, accounting for our motivating linguistic phenomena, and show how expressions using these operators are compiled into the appropriate FSRA.