Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Equivalence of Deterministic One-Counter Automata is NL-complete   We prove that language equivalence of deterministic one-counter automata is
NL-complete. This improves the superpolynomial time complexity upper bound
shown by Valiant and Paterson in 1975. Our main contribution is to prove that
two deterministic one-counter automata are inequivalent if and only if they can
be distinguished by a word of length polynomial in the size of the two input
automata.

25
The categories of this paper are: patt-sol
32
The categories of this paper are: atom-ph
11
The categories of this paper are: hep-lat
17
The categories of this paper are: q-fin
28
The categories of this paper are: alg-geom
12
The categories of this paper are: nucl-th
7
The categories of this paper are: hep-th
20
The categories of this paper are: acc-phys
9
The categories of this paper are: nlin
3
The categories of this paper are: physics
26
The categories of this paper are: bayes-an
24
The categories of this paper are: dg-ga
31
The categories of this paper are: ao-sci
13
The categories of this paper are: quant-ph
8
The categories of this paper are: hep-ex
23
The categories of this paper are: solv-int