Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Enumerating Cryptarithms Using Deterministic Finite Automata   A cryptarithm is a mathematical puzzle where given an arithmetic equation
written with letters rather than numerals, a player must discover an assignment
of numerals on letters that makes the equation hold true. In this paper, we
propose a method to construct a DFA that accepts cryptarithms that admit
(unique) solutions for each base. We implemented the method and constructed a
DFA for bases $k \le 7$. Those DFAs can be used as complete catalogues of
cryptarithms,whose applications include enumeration of and counting the exact
numbers $G_k(n)$ of cryptarithm instances with $n$ digits that admit base-$k$
solutions. Moreover, explicit formulas for $G_2(n)$ and $G_3(n)$ are given.

2
The categories of this paper are: math
13
The categories of this paper are: quant-ph
33
The categories of this paper are: plasm-ph
12
The categories of this paper are: nucl-th
7
The categories of this paper are: hep-th
35
The categories of this paper are: mtrl-th
4
The categories of this paper are: cond-mat
34
The categories of this paper are: chem-ph
14
The categories of this paper are: math-ph
11
The categories of this paper are: hep-lat
36
The categories of this paper are: cmp-lg
32
The categories of this paper are: atom-ph
18
The categories of this paper are: econ
17
The categories of this paper are: q-fin
8
The categories of this paper are: hep-ex
6
The categories of this paper are: astro-ph