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.
Cross-bifix-free sets generation via Motzkin paths / Barcucci, Elena; Bilotta, Stefano; Pergola, Elisa; Pinzani, Renzo; Succi, Jonathan. - In: RAIRO. INFORMATIQUE THEORIQUE ET APPLICATIONS. - ISSN 0988-3754. - STAMPA. - 50:(2016), pp. 81-91. [10.1051/ita/2016008]
Cross-bifix-free sets generation via Motzkin paths
BARCUCCI, ELENA;BILOTTA, STEFANO;PERGOLA, ELISA;PINZANI, RENZO;
2016
Abstract
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.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
CROSS-BIFIX-FREE SETS GENERATION VIA MOTZKIN PATHS.pdf
Accesso chiuso
Tipologia:
Pdf editoriale (Version of record)
Licenza:
Tutti i diritti riservati
Dimensione
466.63 kB
Formato
Adobe PDF
|
466.63 kB | Adobe PDF | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
