Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
Applications of complex variables and related manifolds appear throughout mathematics and science. Here we review a family of basic methods for applying visualization concepts to ...
Discontinuous constituent are a frequent problem in natural language analyses. A constituent is called discontinuous if it is interrupted by other constituents. In German they can ...