Pages that link to "Item:Q5247177"
From MaRDI portal
The following pages link to ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING) (Q5247177):
Displaying 10 items.
- Abelian bordered factors and periodicity (Q499493) (← links)
- Deciding game invariance (Q515578) (← links)
- Disjunctivity and other properties of sets of pseudo-bordered words (Q530214) (← links)
- On highly palindromic words: the ternary case (Q777417) (← links)
- On a theorem concerning partially overlapping subpalindromes of a binary word (Q2070082) (← links)
- Asymptotic analysis of \(q\)-recursive sequences (Q2165029) (← links)
- On highly palindromic words: the \(n\)-ary case (Q2231750) (← links)
- Counting bordered and primitive words with a fixed weight (Q2484439) (← links)
- Automatic Theorem-Proving in Combinatorics on Words (Q2914707) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)