The loop complexity of pure-group events

Abstract

An algorithm is presented for finding the loop complexity (sometimes known as “star height≓) of certain regular events. The algorithm works for those regular events whose syntactic monoid (i.e., semigroup) is a group. The existence of an algorithm that works for all regular events remains an open question.