Finite Loops Recognize Exactly the Regular Open Languages


In this paper, we characterize exactly the class of languages that are recognizable by nite loops, i.e. by cancellative binary algebras with an identity. This turns out to be the well-studied class of regular open languages. Our proof technique is interesting in itself: we generalize the operation of block product of monoids, which is so useful in the… (More)
DOI: 10.1007/3-540-63165-8_169