We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
Let G be a regular graph and H a subgraph on the same vertex set. We give surprisingly compact formulas for the number of copies of H one expects to find in a random subgraph of G...
In a previous paper it was established that there are at least 27 non-isomorphic strongly regular (40, 12, 2, 4) graphs. Using a different and more efficient method we have re-inv...
In this notes we consider the model of Generative Probabilistic Transition Systems, and Baier and Hermanns’ notion of weak bisimulation defined over them. We prove that, if we ...