Cross-bifix-free sets generation via Motzkin paths∗
Dipartimento di Matematica e Informatica “U.Dini”, Università
degli Studi di Firenze, Viale G.B.
Morgagni 65, 50134
firstname.lastname@example.org; email@example.com; firstname.lastname@example.org; email@example.com; firstname.lastname@example.org
Accepted: 24 March 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-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.
Mathematics Subject Classification: 68R05 / 68P30
Key words: Codes / Motzkin paths
© EDP Sciences 2016