Abstract
We solve the isoperimetric problem for subsets in the set χ ∗ of binary sequences of finite length for two cases: 1. (1) the distance counting the minimal number of insertions and deletions transforming one sequence into another; 2. (2) the distance, where in addition also exchanges of letters are allowed. In the earlier work, the range of the competing subsets was limited to the sequences χ n of length n.
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.
