: Mereotopology faces problems when its methods are extended to deal with time and change. We offer a new solution to these problems, based on a theory of partitions of reality wh...
We study caterpillar tree automata [3] that are restricted to enter any subtree at most one time (or k times). We show that, somewhat surprisingly, the deterministic one-visit aut...
Alexander Okhotin, Kai Salomaa, Michael Domaratzki
We develop a decision-theoretic method that yields approximate, low cost troubleshooting plans by making more relevant observations and devoting more time to generate a plan. The ...
This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if k is the degree of the...
In the paper two methods for data structure analysis and visualisation are presented: the simultaneous nonlinear mapping (Sammon, 1969) and the sequential one (Montvilas, 1995). Th...