Cross-bifix-free sets generation via Motzkin paths
From MaRDI portal
Publication:3186677
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
Related Items
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item