2011/12/14 by Stefano Bilotta, Bilotta, Stefano, Elisa Pergola +3
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Algorithms and Data Compression #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #cs.FL #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1112.3168
arxiv created 2011/12/14 · openalex publication_date 2011/12/14 · arxiv updated 2011/12/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Cross-bifix-free sets are sets of words such that no prefix of any word is a suffix of any other word. In this paper, we introduce a general constructive method for the sets of cross-bifix-free binary words of fixed length. It enables us to determine a cross-bifix-free words subset which has the property to be non-expandable.