Identities of locally testable semigroups
A. N. Trahtman · Communications in Algebra · 1999
Let S be a semigroup of words over an alphabet ∑ . Suppose tliar every two words u and e over ∑ are equal in S if (1) the sets of subwords of length k of the words a and b coincide and are non-empty. (2) the prefix (suffix) of u of length k1 is equal to the prefix (suffix) of e. Then S is called k-testable. A semigroup is locally testable if it is k-testable for some k > 0. We present a finite basis of identities of the variety of A'-testable semigroups. The structure of k-testable semigroup is studied. Necessarv and sufficient conditions for local testability will be given. A solution to one problem from the survey of Shevrin and Sukhanov (1985) will be presented.