It accepts a set of regular expressions, representing a set of roots, and a list of patterns, each of which containing exactly n slots.
we introduce a dedicated regular expression operator for circumfixation and show how expressions using this operator are compiled into the appropriate FSRA.