While different algebraic structures have been proposed for the treatment of concurrency, finding solutions for equations over these structures needs to be worked on further. This article is a survey of process algebra from a very narrow viewpoint, that of finite automata and regular languages. What have automata theorists learnt from process algebra about finite state concurrency? The title is...

For distributive double p-algebras, a close connection is established between being congruence coherent and congruence regular. Every congruence regular distributive double p-algebra is congruence coherent. Even though every congruence coherent distributive double p-algebra that has either a non-empty core or finite range is congruence regular, an example is given that is congruence coherent bu...

In this paper we investigate some properties of congruences on ternary semigroups. We also define the notion of congruence on a ternary semigroup generated by a relation and we determine the method of obtaining a congruence on a ternary semigroup T from a relation R on T. Furthermore we study the lattice of congruences on a ternary semigroup and we show that this lattice is not generally modular...

To every morphism of X∗ a congruence fR on X ∗, called kernel congruence, and defined by ufRv iff f(u) = f(v) can be associated. We characterize morphisms having a commutative kernel congruence and, introducing the notion of the index of a morphism, we give a classification of the morphisms of X∗. Moreover, a congruence with special properties, called hp-congruence is considered; every kernel c...

9 The theory of chi processes with the mismatch operator is studied. Four congruence relations are investigated. These are late open congruence, early open congruence, ground congruence and 11 barbed congruence. The late and early open congruence relations are the chi calculus counterparts of the weak late and early congruence relations of pi calculus. Both turn out to be special cases 13 of th...

In this paper we study the generating function of classes of graphs and hypergraphs For a class of labeled graphs C we denote by fC n the number of structures of size n For C de nable in Monadic Second Order Logic with unary and binary relation symbols only E Specker and C Blatter showed in that for every m N fC n satis es a linear recurrence relation fC n Pdm j a m j fC n j over Zm and hence i...