Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Syntactic Complexity of Circular Semi-Flower Automata   We investigate the syntactic complexity of certain types of finitely
generated submonoids of a free monoid. In fact, we consider those submonoids
which are accepted by circular semi-flower automata (CSFA). Here, we show that
the syntactic complexity of CSFA with at most one `branch point going in' (bpi)
is linear. Further, we prove that the syntactic complexity of $n$-state CSFA
with two bpis over a binary alphabet is $2n(n+1)$.

6
The categories of this paper are: astro-ph
32
The categories of this paper are: atom-ph
26
The categories of this paper are: bayes-an
5
The categories of this paper are: gr-qc
2
The categories of this paper are: math
14
The categories of this paper are: math-ph
35
The categories of this paper are: mtrl-th
12
The categories of this paper are: nucl-th
28
The categories of this paper are: alg-geom
16
The categories of this paper are: stat
23
The categories of this paper are: solv-int
8
The categories of this paper are: hep-ex
21
The categories of this paper are: adap-org
29
The categories of this paper are: funct-an
13
The categories of this paper are: quant-ph
22
The categories of this paper are: chao-dyn