Abstract
Most software packages with regular expression matching engines offer operators that extend the classical regular expressions, such as counting, intersection, complementation, and interleaving. Some of the most popular engines, for example those of Java and Perl, also provide operators that are intended to control the nondeterminism inherent in regular expressions. We formalize this notion in the form of the cut and iterated cut operators. They do not extend the class of languages that can be defined beyond the regular, but they allow for exponentially more succinct representation of some languages. Membership testing remains polynomial, but emptiness testing becomes PSPACE-hard. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Berglund, M., Björklund, H., Drewes, F., Van Der Merwe, B., & Watson, B. (2013). Cuts in regular expressions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7907 LNCS, pp. 70–81). https://doi.org/10.1007/978-3-642-38771-5_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
