Strongly locally testable semigroups with commuting idempotents and related languages
Strongly locally testable semigroups with commuting idempotents and related languages
If we consider words over the alphabet which is the set of all elements of a semigroup , then such a word determines an element of : the product of the letters of the word. is strongly locally testable if whenever two words over the alphabet have the same factors of a fixed length , then the products of the letters of these words are equal. We had previously proved [19] that the syntactic semigroup of a rational language is strongly locally testable if and only if is both locally and piecewise...
Page 1