In this paper we provide an automaton-based solution to the decision problem for a large set of monadic second-order theories of deterministic tree structures. We achieve it in two...
Voluntary standardisation bodies regularly issue calls for increased user participation in their work groups. This paper challenges such calls. It suggests that users are not norm...
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
We show that any regular set of basic MSCs can be implemented by a deadlock-free communicating finite-state machine with local termination: Processes stop in local dead-states ind...