Dyck words, lattice paths, and abelian borders
From MaRDI portal
Publication:5016359
Recommendations
Cites work
- scientific article; zbMATH DE number 5605094 (Why is no real title available?)
- A note on efficient computation of all abelian periods in a string
- Abelian borders in binary words
- Abelian periods, partial words, and an extension of a theorem of Fine and Wilf
- Algorithms for computing abelian periods of words
- Algorithms for jumbled pattern matching in strings
- Binomial determinants, paths, and hook length formulae
- Counting pairs of lattice paths by intersections
- Dyck path enumeration
- Fast algorithms for abelian periods in words and greatest common divisor queries
- Narayana numbers and Schur-Szegő composition
- On abelian versions of critical factorization theorem
- On approximate jumbled pattern matching in strings
- On the Vector Representations of Induced Matroids
- On the number of abelian bordered words
- Oscillating rim hook tableaux and colored matchings
- Scaled and permuted string matching
Cited in
(11)- On highly palindromic words: the \(n\)-ary case
- On the number of abelian bordered words (with an example of automatic theorem-proving)
- Abelian borders in binary words
- The phagocyte lattice of Dyck words
- On the number of abelian bordered words
- Dyck Words, Lattice Paths, and Abelian Borders
- Dyck Words, Pattern Avoidance, and Automatic Sequences
- Dyck words, pattern avoidance, and automatic sequences
- On highly palindromic words: the ternary case
- On a theorem concerning partially overlapping subpalindromes of a binary word
- Enumeration of bordered words, le langage de la vache-qui-rit
This page was built for publication: Dyck words, lattice paths, and abelian borders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5016359)
