Abstract
ABSTRACTLet , where , be the set of ith powers of primitive words. A language is called strongly bi-singular if the minimal-length words in it are neither prefixes nor suffixes of any other word in the language. Strongly bi-singular languages forms a free monoid with respect to the concatenation of languages. The main result of this paper is that if we start with the basis of this free monoid together with the languages for all , then the resulting family of languages is a code. So we find a free monoid which properly contains the free monoid of all strongly bi-singular languages.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computer Mathematics: Computer Systems Theory
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.
