Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Descriptional Complexity of Non-Unary Self-Verifying Symmetric
  Difference Automata   Previously, self-verifying symmetric difference automata were defined and a
tight bound of 2^n-1-1 was shown for state complexity in the unary case. We now
consider the non-unary case and show that, for every n at least 2, there is a
regular language L_n accepted by a non-unary self-verifying symmetric
difference nondeterministic automaton with n states, such that its equivalent
minimal deterministic finite automaton has 2^n-1 states. Also, given any
SV-XNFA with n states, it is possible, up to isomorphism, to find at most
another |GL(n,Z_2)|-1 equivalent SV-XNFA.

28
The categories of this paper are: alg-geom
11
The categories of this paper are: hep-lat
23
The categories of this paper are: solv-int
6
The categories of this paper are: astro-ph
17
The categories of this paper are: q-fin
10
The categories of this paper are: q-bio
21
The categories of this paper are: adap-org
0
The categories of this paper are: hep-ph
36
The categories of this paper are: cmp-lg
5
The categories of this paper are: gr-qc
13
The categories of this paper are: quant-ph
31
The categories of this paper are: ao-sci
22
The categories of this paper are: chao-dyn
18
The categories of this paper are: econ
8
The categories of this paper are: hep-ex
32
The categories of this paper are: atom-ph