Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Quotient Complexity of Regular Languages   The past research on the state complexity of operations on regular languages
is examined, and a new approach based on an old method (derivatives of regular
expressions) is presented. Since state complexity is a property of a language,
it is appropriate to define it in formal-language terms as the number of
distinct quotients of the language, and to call it "quotient complexity". The
problem of finding the quotient complexity of a language f(K,L) is considered,
where K and L are regular languages and f is a regular operation, for example,
union or concatenation. Since quotients can be represented by derivatives, one
can find a formula for the typical quotient of f(K,L) in terms of the quotients
of K and L. To obtain an upper bound on the number of quotients of f(K,L) all
one has to do is count how many such quotients are possible, and this makes
automaton constructions unnecessary. The advantages of this point of view are
illustrated by many examples. Moreover, new general observations are presented
to help in the estimation of the upper bounds on quotient complexity of regular
operations.

34
The categories of this paper are: chem-ph
18
The categories of this paper are: econ
31
The categories of this paper are: ao-sci
26
The categories of this paper are: bayes-an
24
The categories of this paper are: dg-ga
36
The categories of this paper are: cmp-lg
7
The categories of this paper are: hep-th
16
The categories of this paper are: stat
12
The categories of this paper are: nucl-th
22
The categories of this paper are: chao-dyn
5
The categories of this paper are: gr-qc
37
The categories of this paper are: supr-con
29
The categories of this paper are: funct-an
23
The categories of this paper are: solv-int
9
The categories of this paper are: nlin
14
The categories of this paper are: math-ph