English

A new approach to cross-bifix-free sets

Formal Languages and Automata Theory 2011-12-15 v1

Abstract

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.

Cite

@article{arxiv.1112.3168,
  title  = {A new approach to cross-bifix-free sets},
  author = {Stefano Bilotta and Elisa Pergola and Renzo Pinzani},
  journal= {arXiv preprint arXiv:1112.3168},
  year   = {2011}
}
R2 v1 2026-06-21T19:51:05.332Z