Abstract
In the field of combinatorics on words, it is known that {u, v}, the language with two words is a code if and only if $uv\neq vu$ . But up to now general characterization for codes consisting of any three words has not been found. In 1998, Fan, Shyr and Yu provided a characterization for codes consisting of three d-primitive words. In this paper, we give characterizations for a code with three words in which one of the words is d-primitive.
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 callSimilar Papers
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.
