We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
We give a detailed construction of a finite-state transition system for a com-connected Message Sequence Graph. Though this result is fairly well-known in the literature there has...
Ridership is a key goal in the transit industry. Conventional transit analysis focuses
on two types of users—captive and choice riders—but rarely aims to understand the
prefe...
Abstract. We study the nonequilibrium phenomena of a coupled active rotator model in complex networks. From a numerical Langevin simulation, we find the peculiar phase transition ...