This paper investigates some relations among four complexities of sequence over countably infinite alphabet, and shows that two kinds of empirical entropies and the self-entropy r...
We show that the class of Petri nets is less expressive with respect to bisimulation equivalence than the class of PA processes extended with a finite state control unit. Key word...
We calculate a fixed finite set of state space fragments for a service P, where each fragment carries a part of the whole behavior of P. By composing these fragments according to t...
A two-way finite automaton is sweeping if its input head can change direction only on the end-markers. For each n ≥ 2, we exhibit a problem that can be solved by a O(n2 )-state ...
Abstract. Given a one dimensional SOM with a monotonically decreasing neighbourhood and an input distribution which is not Lebesque continuous, a set of su cient conditions and a T...