Cross-bifix-free sets generationviaMotzkin paths
Elena Barcucci, Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Jonathan Succi · RAIRO - Theoretical Informatics and Applications · 2016
Cross-bifix-free sets are sets of words such that no proper prefix of any word is a proper suffix of any other word. In this paper, we introduce a general constructive method for the sets of cross-bifix-freeq-ary words of fixed length. It enables us to determine a cross-bifix-free words subset which has the property to be non-expandable.