Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Decidability of multiset, set and numerically decipherable directed
  figure codes   Codes with various kinds of decipherability, weaker than the usual unique
decipherability, have been studied since multiset decipherability was
introduced in mid-1980s. We consider decipherability of directed figure codes,
where directed figures are defined as labelled polyominoes with designated
start and end points, equipped with catenation operation that may use a merging
function to resolve possible conflicts. This is one of possible extensions
generalizing words and variable-length codes to planar structures. Here,
verification whether a given set is a code is no longer decidable in general.
We study the decidability status of figure codes depending on catenation type
(with or without a merging function), decipherability kind (unique, multiset,
set or numeric) and code geometry (several classes determined by relative
positions of start and end points of figures). We give decidability or
undecidability proofs in all but two cases that remain open.

24
The categories of this paper are: dg-ga
23
The categories of this paper are: solv-int
20
The categories of this paper are: acc-phys
10
The categories of this paper are: q-bio
22
The categories of this paper are: chao-dyn
29
The categories of this paper are: funct-an
2
The categories of this paper are: math
31
The categories of this paper are: ao-sci
17
The categories of this paper are: q-fin
21
The categories of this paper are: adap-org
36
The categories of this paper are: cmp-lg
7
The categories of this paper are: hep-th
33
The categories of this paper are: plasm-ph
9
The categories of this paper are: nlin
0
The categories of this paper are: hep-ph
35
The categories of this paper are: mtrl-th