Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: 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
determinism for regular expressions used in XML DTDs and XML Schema. This
includes the definition of a suitable automaton model, and a generalization of
the Glushkov construction. We demonstrate that, compared to their
non-deterministic superclass, these deterministic regular expressions with
back-references have desirable algorithmic properties (i.e., efficiently
solvable membership problem and some decidable problems in static analysis),
while, at the same time, their expressive power exceeds that of deterministic
regular expressions without back-references.

17
The categories of this paper are: q-fin
32
The categories of this paper are: atom-ph
11
The categories of this paper are: hep-lat
15
The categories of this paper are: nucl-ex
16
The categories of this paper are: stat
4
The categories of this paper are: cond-mat
25
The categories of this paper are: patt-sol
35
The categories of this paper are: mtrl-th
33
The categories of this paper are: plasm-ph
23
The categories of this paper are: solv-int
8
The categories of this paper are: hep-ex
6
The categories of this paper are: astro-ph
5
The categories of this paper are: gr-qc
0
The categories of this paper are: hep-ph
9
The categories of this paper are: nlin
22
The categories of this paper are: chao-dyn