Abstract
Given a finite subset X of a free monoid A∗, we define the rank of X as r( X = min {;∣ Y∣: X ⊆ Y∗};. The problem we study here is to decide whether or not r( X)⩽2. We propose an O( nln 2 m) algorithm, where n stands for the sum of the lenghts of the words in X, and m stands for the length of the longest word.
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.
