A Decision Procedure for the Order of Regular Events

Abstract A regular event R is said to be of finite order if Rk=Rk+1 for some nonnegative integer k. It is shown that there exists an algorithm for deciding whether an arbitrary regular events is of finite order or not.