Cross-bifix-free sets via Motzkin paths generation
Combinatorics
2014-10-20 v1
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.
Cite
@article{arxiv.1410.4710,
title = {Cross-bifix-free sets via Motzkin paths generation},
author = {Elena Barcucci and Stefano Bilotta and Elisa Pergola and Renzo Pinzani and Jonathan Succi},
journal= {arXiv preprint arXiv:1410.4710},
year = {2014}
}