The following pages link to Stefano Bilotta (Q458741):
Displayed 25 items.
- (Q391430) (redirect page) (← links)
- Catalan structures and Catalan pairs (Q391433) (← links)
- Prefix partitioned Gray codes for particular cross-bifix-free sets (Q458743) (← links)
- Cross-bifix-free sets in two dimensions (Q517032) (← links)
- Non-overlapping matrices (Q728263) (← links)
- A 2D non-overlapping code over a \(q\)-ary alphabet (Q1704207) (← links)
- Avoiding cross-bifix-free binary words (Q2377303) (← links)
- Recurrence relations, succession rules and the positivity problem (Q2424677) (← links)
- Pattern 1^j0^i avoiding binary words (Q2789513) (← links)
- Recurrence Relations, Succession Rules, and the Positivity Problem (Q2799201) (← links)
- Polygons Drawn from Permutations (Q2844605) (← links)
- A generating function for bit strings with no Grand Dyck pattern matching (Q2973209) (← links)
- Cross-bifix-free sets generation <i>via </i>Motzkin paths (Q3186677) (← links)
- Discrete Tomography Reconstruction Algorithms for Images with a Blocking Component (Q3190084) (← links)
- (Q3457635) (← links)
- Variable-Length Non-Overlapping Codes (Q4566508) (← links)
- Pattern Avoiding Languages and Recurrence Relations Interpretation (Q4606259) (← links)
- Non-overlapping matrices via Dyck words (Q5056204) (← links)
- A New Approach to Cross-Bifix-Free Sets (Q5271867) (← links)
- (Q5326718) (← links)
- (Q5404314) (← links)
- (Q6076148) (← links)
- A Construction for Variable Dimension Strong Non-Overlapping Matrices (Q6204123) (← links)
- Recurrence relations versus succession rules (Q6238725) (← links)
- Non-overlapping Dyck matrices (Q6310278) (← links)