Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Almost Equivalence by Asymptotic Probabilities for Regular Languages
  and Its Computational Complexities   We introduce p-equivalence by asymptotic probabilities, which is a weak
almost-equivalence based on zero-one laws in finite model theory. In this
paper, we consider the computational complexities of p-equivalence problems for
regular languages and provide the following details. First, we give an
robustness of p-equivalence and a logical characterization for p-equivalence.
The characterization is useful to generate some algorithms for p-equivalence
problems by coupling with standard results from descriptive complexity. Second,
we give the computational complexities for the p-equivalence problems by the
logical characterization. The computational complexities are the same as for
the (fully) equivalence problems. Finally, we apply the proofs for
p-equivalence to some generalized equivalences.

6
The categories of this paper are: astro-ph
12
The categories of this paper are: nucl-th
22
The categories of this paper are: chao-dyn
24
The categories of this paper are: dg-ga
0
The categories of this paper are: hep-ph
18
The categories of this paper are: econ
7
The categories of this paper are: hep-th
37
The categories of this paper are: supr-con
21
The categories of this paper are: adap-org
8
The categories of this paper are: hep-ex
10
The categories of this paper are: q-bio
20
The categories of this paper are: acc-phys
33
The categories of this paper are: plasm-ph
28
The categories of this paper are: alg-geom
32
The categories of this paper are: atom-ph
19
The categories of this paper are: eess