On bases of identities for the ω-variety generated by locally testable semigroups∗
نویسندگان
چکیده
In this paper, we exhibit an infinite basis of ω-identities for the ω-variety generated by the pseudovariety LSl, of semigroups which are locally semilattices, and we show that this ω-variety is not finitely based.
منابع مشابه
A System of Bi-identities for Locally Inverse Semigroups
A class of regular semigroups closed under taking direct products, regular subsemigroups, and homomorphic images is an existence-variety (or evariety) of regular semigroups. Each e-variety of locally inverse semigroups can be characterized by a set of bi-identities. These are identities of terms of type (2, 2) in two sorts of variables X and X'. In this paper we obtain a basis of bi-identities ...
متن کاملThe Equational Theory of Ω-terms for Finite R-trivial Semigroups∗
A new topological representation for free profinite R-trivial semigroups in terms of spaces of vertex-labeled complete binary trees is obtained. Such a tree may be naturally folded into a finite automaton if and only if the element it represents is an ω-term. The variety of ω-semigroups generated by all finite R-trivial semigroups, with the usual interpretation of the ω-power, is then studied. ...
متن کاملA Polynomial Time Algorithm for Local Testability and its Level
A locally testable semigroup S is a semigroup with the property that for some nonnegative integer k, called the order or level of local testability, two words u and v in some set of generators for S are equal in the semigroup if (1) the pre x and su x of the words of length k coincide, and (2) the set of intermediate substrings of length k of the words coincide. The local testability problem fo...
متن کامل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 S, then such a word determines an element of S: the product of the letters of the word. S is strongly locally testable if whenever two words over the alphabet S have the same factors of a fixed length k, then the products of the letters of these words are equal. We had previously proved [19] that the syntacti...
متن کاملRight and left strongly locally testable semigroups and languages
The objective of this paper is to de ne and characterize the families of right (left) strongly locally testable languages (RSLT and LSLT ) and semigroups (RSLTS and LSLTS). Given k > 0, the membership of a w ord x to a RSLT (RSTk) language can be decided by exploring the segments of length k of x, as well as considering the order of appearance of those segments when we scan the pre xes of x. A ...
متن کامل