Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Feasible Automata for Two-Variable Logic with Successor on Data Words   We introduce an automata model for data words, that is words that carry at
each position a symbol from a finite alphabet and a value from an unbounded
data domain. The model is (semantically) a restriction of data automata,
introduced by Bojanczyk, et. al. in 2006, therefore it is called weak data
automata. It is strictly less expressive than data automata and the expressive
power is incomparable with register automata. The expressive power of weak data
automata corresponds exactly to existential monadic second order logic with
successor +1 and data value equality \sim, EMSO2(+1,\sim). It follows from
previous work, David, et. al. in 2010, that the nonemptiness problem for weak
data automata can be decided in 2-NEXPTIME. Furthermore, we study weak B\"uchi
automata on data omega-strings. They can be characterized by the extension of
EMSO2(+1,\sim) with existential quantifiers for infinite sets. Finally, the
same complexity bound for its nonemptiness problem is established by a
nondeterministic polynomial time reduction to the nonemptiness problem of weak
data automata.

32
The categories of this paper are: atom-ph
18
The categories of this paper are: econ
26
The categories of this paper are: bayes-an
27
The categories of this paper are: comp-gas
31
The categories of this paper are: ao-sci
6
The categories of this paper are: astro-ph
5
The categories of this paper are: gr-qc
12
The categories of this paper are: nucl-th
9
The categories of this paper are: nlin
20
The categories of this paper are: acc-phys
21
The categories of this paper are: adap-org
30
The categories of this paper are: q-alg
23
The categories of this paper are: solv-int
24
The categories of this paper are: dg-ga
14
The categories of this paper are: math-ph
22
The categories of this paper are: chao-dyn