Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Synthesizing Structured Reactive Programs via Deterministic Tree
  Automata   Existing approaches to the synthesis of reactive systems typically involve
the construction of transition systems such as Mealy automata. However, in
order to obtain a succinct representation of the desired system, structured
programs can be a more suitable model. In 2011, Madhusudan proposed an
algorithm to construct a structured reactive program for a given omega-regular
specification without synthesizing a transition system first. His procedure is
based on two-way alternating omega-automata on finite trees that recognize the
set of "correct" programs.
  We present a more elementary and direct approach using only deterministic
bottom-up tree automata that compute so-called signatures for a given program.
In doing so, we extend Madhusudan's results to the wider class of programs with
bounded delay, which may read several input symbols before producing an output
symbol (or vice versa). As a formal foundation, we inductively define a
semantics for such programs.

14
The categories of this paper are: math-ph
17
The categories of this paper are: q-fin
20
The categories of this paper are: acc-phys
22
The categories of this paper are: chao-dyn
7
The categories of this paper are: hep-th
13
The categories of this paper are: quant-ph
9
The categories of this paper are: nlin
34
The categories of this paper are: chem-ph
21
The categories of this paper are: adap-org
37
The categories of this paper are: supr-con
10
The categories of this paper are: q-bio
31
The categories of this paper are: ao-sci
28
The categories of this paper are: alg-geom
32
The categories of this paper are: atom-ph
24
The categories of this paper are: dg-ga
16
The categories of this paper are: stat