Abstract
In the framework of two Schützenberger’s conjectures on codes, we characterize the degree of finite maximal codes over the alphabet {a, b} with at most 3 occurrences of the letter b in each word; it is strongly related to the number of factorizations of the code. We also describe all the indecomposable codes inside this family.
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.
