Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Descriptional complexity of bounded context-free languages   Finite-turn pushdown automata (PDA) are investigated concerning their
descriptional complexity. It is known that they accept exactly the class of
ultralinear context-free languages. Furthermore, the increase in size when
converting arbitrary PDAs accepting ultralinear languages to finite-turn PDAs
cannot be bounded by any recursive function. The latter phenomenon is known as
non-recursive trade-off. In this paper, finite-turn PDAs accepting bounded
languages are considered. First, letter-bounded languages are studied. We prove
that in this case the non-recursive trade-off is reduced to a recursive
trade-off, more precisely, to an exponential trade-off. A conversion algorithm
is presented and the optimality of the construction is shown by proving tight
lower bounds. Furthermore, the question of reducing the number of turns of a
given finite-turn PDA is studied. Again, a conversion algorithm is provided
which shows that in this case the trade-off is at most polynomial. Finally, the
more general case of word-bounded languages is investigated. We show how the
results obtained for letter-bounded languages can be extended to word-bounded
languages.

3
The categories of this paper are: physics
35
The categories of this paper are: mtrl-th
19
The categories of this paper are: eess
24
The categories of this paper are: dg-ga
16
The categories of this paper are: stat
13
The categories of this paper are: quant-ph
26
The categories of this paper are: bayes-an
11
The categories of this paper are: hep-lat
10
The categories of this paper are: q-bio
31
The categories of this paper are: ao-sci
4
The categories of this paper are: cond-mat
22
The categories of this paper are: chao-dyn
8
The categories of this paper are: hep-ex
0
The categories of this paper are: hep-ph
6
The categories of this paper are: astro-ph
18
The categories of this paper are: econ