Found 1 document(s)
Page 1 of 1
-
Weakly recognizing morphisms from free semigroups onto finite semigroups are a classical way for defining the class of $$\omega $$-regular languages, i.e., a set of infinite words is weakly recognizable by such a morphis...