Labelled Markov processes are probabilistic versions of labelled transition systems. Labelled transition systems where the final state is.. Labelled Markov processes are probabilistic versions of labelled transition systems. Labelled transition systems where the final state is.. Systems that can be in a state and have transitions between states; these transitions are triggered by actions. The t...

Consider a rooted tree structure the nodes of which have been labelled monotonically by elements of { 1, 2, . . .,k}, which means that any sequence connecting the root of the tree with a leaf is weakly monotone . For fixed k asymptotic equivalents of the form CA gA °n; 2 (n --oo) to the numbers of such tree structures with n nodes are obtained for the family of extended unary-binary trees (i .e...

For simplicity, we adopt the following convention: x, x1, x2, y, y1, y2, z, z1, z2, X, X1, X2 are sets, E is a non empty set, e is an element of E, u, v, v1, v2, w, w1, w2 are elements of Eω, F , F1, F2 are subsets of Eω, and k, l are natural numbers. Next we state a number of propositions: (1) For every finite sequence p such that k ∈ dom p holds (〈x〉 a p)(k+ 1) = p(k). (2) For every finite se...

Lévy’s labelled λ-calculus has played an important role in the understanding of the Geometry of Interaction and its applications to the implementation of λ-evaluators: labels relate to the multiplicative information of paths. In this paper, we generalise the structure of labels, and the underlying term structure, in order to keep track of exponential information too. We first define two labelle...

We show how labelled deductive systems can be combined with a logical framework to provide a natural deduction implementation of a large and well-known class of propositional modal logics (including K, D, T, B, S4, S4:2, KD45, S5). Our approach is modular and based on a separation between a base logic and a labelling algebra, which interact through a xed interface. While the base logic stays xe...

We describe a class of C *-algebras which simultaneously generalise the ul-tragraph algebras of Tomforde and the shift space C *-algebras of Matsumoto. In doing so we shed some new light on the different C *-algebras that may be associated to a shift space. Finally, we show how to associate a simple C *-algebra to an irreducible sofic shift.

Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been addressed. We examine this question by attaching unique labels to the triangulation edges. We introduce the concept of the orbit of an edge e, which is the set of all edges reachable from e via flips. We establish the...

ion In concurrency theory it is often useful to distinguish between internal actions, that do not admit interactions with the outside world, and external ones. As normally there is no need to distinguish the internal actions from each other, they all have the same name, namely τ . If A is the set of external actions a certain class of systems may perform, then Aτ := A . ∪ {τ}. Systems in that c...

General object recognition is a difficult problem. In [2], we proposed a novel solution for object recognition in an unconstrained environment. We simplified the recognition problem by attaching a special planar pattern on objects of interest. This approach allows us to determine the pose easily. A robust detector for the pattern was developed for the first stage of the solution (Soh[3]). This ...

Given two undirected trees T and P , the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as repeatedly removing a degree-2 node and adding the edge joining its two neighbors. In this paper we extend the Subtree Homeomorphism Problem to a new optimization problem by enriching the subtree-comparison with node-t...