Dyck Words, Lattice Paths, and Abelian Borders
From MaRDI portal
Publication:6114866
DOI10.1142/s0129054122410027zbMath1529.68234OpenAlexW4226341688WikidataQ114978621 ScholiaQ114978621MaRDI QIDQ6114866
Kun Chen, Kenneth Hawes, Francine Blanchet-Sadri
Publication date: 15 August 2023
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054122410027
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Oscillating rim hook tableaux and colored matchings
- Algorithms for computing abelian periods of words
- Abelian bordered factors and periodicity
- On approximate jumbled pattern matching in strings
- Scaled and permuted string matching
- Narayana numbers and Schur-Szegő composition
- Binomial determinants, paths, and hook length formulae
- Dyck path enumeration
- Counting pairs of lattice paths by intersections
- A note on efficient computation of all abelian periods in a string
- Abelian borders in binary words
- ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS
- On abelian versions of critical factorization theorem
- Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries
- On the Number of Abelian Bordered Words
- Abelian periods, partial words, and an extension of a theorem of Fine and Wilf
- On the Vector Representations of Induced Matroids
- Motzkin numbers
This page was built for publication: Dyck Words, Lattice Paths, and Abelian Borders
