Abstract
We give an algebraic characterization of a new variety of languages that will be called bilateral locally testable languages and denoted as BLT. Given k>0, the membership of a word x to a BLT (k-BT) language can be decided by means of exploring the segments of length k of x, as well as considering the order of appearance of those segments when we scan the prefixes and the suffixes of x. In this paper, we also characterize the syntactic semigroup of BLT languages in terms of the equations of the variety they belong to, as well as in terms of the join of two previously studied varieties.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.