Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Forest languages defined by counting maximal paths   A leaf path language is a Boolean combination of sets of the form
$\mathsf{{}^mE}^k L$, with $k \ge 1$ and $L$ a regular word language, which
consist of those forests where the node labels in at least $k$ leaf-to-root
paths make up a word that belongs to $L$. We look at the class $\mathsf{*D}$ of
the languages recognized by iterated wreath products of syntactic algebras of
leaf path languages. We prove the existence of an algorithm that, given a
regular forest language, returns in finite time a sequence of such algebras;
their wreath product is divided by the language's syntactic algebra if, and
only if this language belongs to $\mathsf{*D}$, which makes membership in this
class a decidable question. The result also applies to the subclasses
$\mathsf{PDL}$ and $\mathsf{CTL^*}$.

19
The categories of this paper are: eess
26
The categories of this paper are: bayes-an
21
The categories of this paper are: adap-org
8
The categories of this paper are: hep-ex
3
The categories of this paper are: physics
36
The categories of this paper are: cmp-lg
31
The categories of this paper are: ao-sci
7
The categories of this paper are: hep-th
37
The categories of this paper are: supr-con
2
The categories of this paper are: math
0
The categories of this paper are: hep-ph
17
The categories of this paper are: q-fin
16
The categories of this paper are: stat
22
The categories of this paper are: chao-dyn
27
The categories of this paper are: comp-gas
13
The categories of this paper are: quant-ph