The following pages link to Pavel Salimov (Q2257293):
Displaying 13 items.
- (Q496048) (redirect page) (← links)
- Another generalization of abelian equivalence: binomial complexity of infinite words (Q496049) (← links)
- Avoiding 2-binomial squares and cubes (Q2257294) (← links)
- A note on abelian returns in rotation words (Q2437858) (← links)
- Restricted non-separable planar maps and some pattern avoiding permutations (Q2444543) (← links)
- Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words (Q2849991) (← links)
- On maximal pattern complexity of some automatic words (Q3093792) (← links)
- On the Representability of Line Graphs (Q5199997) (← links)
- ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING) (Q5247177) (← links)
- On the Number of Abelian Bordered Words (Q5300859) (← links)
- Word-Representability of Line Graphs (Q5350464) (← links)
- (Q5404285) (← links)
- (Q5414544) (← links)
