Abstract
A language L such that no word in L is a proper factor of another word in L is said to be an infix code. A language L such that no word in L can be obtained from another word in L by the cancellation of a proper factor is called an outfix code. We derive properties of infix and outfix codes which describe their relation to other classes of codes and which determine their combinatorial structures. In particular, we consider closure properties of these and related classes of codes, maximal codes within these classes, the syntactic monoids of such codes, and the connection of these codes with binary relations on the free monoid.
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 callDisclaimer: 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.
