RAIRO-Theor. Inf. Appl.
Volume 50, Number 1, January-March 2016Special issue dedicated to the 15th "Journées Montoises d'Informatique Théorique"
|Page(s)||81 - 91|
|Published online||02 June 2016|
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.