Cross-bifix-free sets generation via Motzkin paths

DOI10.1051/ita/2016008zbMath1371.68219arXiv1410.4710OpenAlexW2423440967MaRDI QIDQ3186677

Elisa Pergola, Elena Barcucci, Jonathan Succi, Renzo Pinzani, Stefano Bilotta

Publication date: 12 August 2016

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.4710

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (2)

Non-overlapping matrices via Dyck words ⋮ A 2D non-overlapping code over a \(q\)-ary alphabet

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Avoiding cross-bifix-free binary words
• A simple suboptimal construction of cross-bifix-free codes
• Non-Overlapping Codes
• On the expected duration of a search for a fixed pattern in random data (Corresp.)
• A note on bifix-free sequences (Corresp.)
• A New Approach to Cross-Bifix-Free Sets
• Cross-Bifix-Free Codes Within a Constant Factor of Optimality
• Algorithms on Strings
• Motzkin numbers

This page was built for publication: Cross-bifix-free sets generation via Motzkin paths