When engineering process-aware information systems (PAISs) one of the fundamental challenges is to cope with the variability of business processes. While some progress has been achieved regarding the configuration of process ...

We show that every sparse set S can be many-one reduced to an appropriate tally set T by a polynomial-time, randomized reduction (see formal definitions below). Since T is in NP if S is in NP, this result can be used to ...

In this paper we introduce a new formal model for the concept of syntax--directed semantics, called macro attributed tree transducer (for short: mat tree transducer). This model is based on (noncircular) attributed tree ...

We formalize a universal unification algorithm for the class of equational theories which is induced by the class of canonical, totally-defined, not strictly subunifiable term rewriting systems (for short: ctn-trs). For a ...

N/A

We consider particular functional programs in which on the one hand the recursion is restricted to syntax-directed recursion and on the other hand simultaneous recursion and nesting of function calls in parameter positions ...

N/A

N/A

N/A

N/A