Avoiding cross-bifix-free binary words
From MaRDI portal
Publication:2377303
DOI10.1007/s00236-013-0176-4zbMath1310.68171arXiv1210.7620OpenAlexW2089554597MaRDI QIDQ2377303
Stefano Bilotta, Elisabetta Grazzini, Renzo Pinzani, Elisa Pergola
Publication date: 28 June 2013
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.7620
Related Items (7)
Cross-bifix-free sets generation via Motzkin paths ⋮ Recurrence relations, succession rules and the positivity problem ⋮ A 2D non-overlapping code over a \(q\)-ary alphabet ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Cross-bifix-free sets in two dimensions ⋮ Recurrence Relations, Succession Rules, and the Positivity Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general exhaustive generation algorithm for Gray structures
- String overlaps, pattern matching, and nontransitive games
- Generating functions for generating trees
- Jumping succession rules and their generating functions
- A linear operator approach to succession rules
- Compact recognizers of episode sequences
- Exhaustive generation of combinatorial objects by ECO
- Counting bordered and primitive words with a fixed weight
- Pattern 1j+10j Avoiding Binary Words
- Hidden word statistics
- Long repetitive patterns in random sequences
- Some Combinatorial Properties of Free Semigroups
- On the expected duration of a search for a fixed pattern in random data (Corresp.)
- A note on bifix-free sequences (Corresp.)
- ECO:a methodology for the enumeration of combinatorial objects
- A New Approach to Cross-Bifix-Free Sets
This page was built for publication: Avoiding cross-bifix-free binary words