Deterministic regular expressions with back-references

Most modern libraries for regular expression matching allow back-references (i. e., repetition operators) that substantially increase expressive power, but also lead to intractability. In order to find a better balance between expressiveness and tractability, we combine these with the notion of dete...

Full description

Bibliographic Details

Main Authors:	Dominik Freydenberger, Markus L. Schmid
Format:	Default Conference proceeding
Published:	2017
Subjects:	Other information and computing sciences not elsewhere classified Deterministic regular expression Regex Glushkov automaton Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/24359
Tags:	Add Tag No Tags, Be the first to tag this record!