Pages that link to "Item:Q458743"
From MaRDI portal
The following pages link to Prefix partitioned Gray codes for particular cross-bifix-free sets (Q458743):
Displaying 17 items.
- Prefix partitioned Gray codes for particular cross-bifix-free sets (Q458743) (← links)
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions (Q500971) (← links)
- Cross-bifix-free sets in two dimensions (Q517032) (← links)
- Loop-free Gray code algorithms for the set of compositions (Q655198) (← links)
- A 2D non-overlapping code over a \(q\)-ary alphabet (Q1704207) (← links)
- Gray codes for \(A\)-free strings (Q1918874) (← links)
- Generating a Gray code for prefix normal words in amortized polylogarithmic time per word (Q2006779) (← links)
- Gray cycles of maximum length related to \(k\)-character substitutions (Q2096591) (← links)
- A simple suboptimal construction of cross-bifix-free codes (Q2434764) (← links)
- (Q2971062) (redirect page) (← links)
- Cross-bifix-free sets generation <i>via </i>Motzkin paths (Q3186677) (← links)
- (Q3414550) (← links)
- (Q4616107) (← links)
- Non-overlapping matrices via Dyck words (Q5056204) (← links)
- Gray codes for noncrossing and nonnesting partitions of classical types (Q5365322) (← links)
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions (Q6052708) (← links)
- A Construction for Variable Dimension Strong Non-Overlapping Matrices (Q6204123) (← links)