Cross-bifix-free sets via Motzkin paths generation
classification
🧮 math.CO
keywords
cross-bifix-freesetswordswordconstructivedetermineenablesfixed
read the original abstract
Cross-bifix-free sets are sets of words such that no prefix of any word is a sufix of any other word. In this paper, we introduce a general constructive method for the sets of cross-bifix-free q-ary words of fixed length. It enables us to determine a cross-bifix-free words subset which has the property to be non-expandable.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.