Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Games for Succinctness of Regular Expressions   We present a version of so called formula size games for regular expressions.
These games characterize the equivalence of languages up to expressions of a
given size. We use the regular expression size game to give a simple proof of a
known non-elementary succinctness gap between first-order logic and regular
expressions. We also use the game to only count the number of stars in an
expression instead of the overall size. For regular expressions this measure
trivially gives a hierarchy in terms of expressive power. We obtain such a
hierarchy also for what we call RE over star-free expressions, where star-free
expressions, that is ones with complement but no stars, are combined using the
operations of regular expressions.

0
The categories of this paper are: hep-ph
13
The categories of this paper are: quant-ph
17
The categories of this paper are: q-fin
10
The categories of this paper are: q-bio
25
The categories of this paper are: patt-sol
8
The categories of this paper are: hep-ex
2
The categories of this paper are: math
35
The categories of this paper are: mtrl-th
24
The categories of this paper are: dg-ga
22
The categories of this paper are: chao-dyn
21
The categories of this paper are: adap-org
26
The categories of this paper are: bayes-an
12
The categories of this paper are: nucl-th
29
The categories of this paper are: funct-an
4
The categories of this paper are: cond-mat
31
The categories of this paper are: ao-sci