Learn More
tn this paper, we give a solution of the Firing Squad Synchronization Problem for graphs. The synchronization *imes of solutions which have been obtained are proportional to the number or nodes of a graph. T~e synchronization time of our solution is proport[onal to the radius rG of a graph G (3re; + 1 or 3rG time units), where rG is the longest distance(More)
A homomorphism f from the set of words over a finite alphabet Z' 1 to the set of words over another finite alphabet X 2 is said to preserve star height if for all regula r events R _C Z'~*, the star height of R is equal to that off(R). An algorithm is presented for deciding whether an arbitrary homomorphism preserves star height or not: in our result, the(More)