Abstract
Two paths are equivalent modulo a given string τ, whenever they have the same length and the positions of the occurrences of τ are the same in both paths. This equivalence relation was introduced for Dyck paths in Baril and Petrossian (2015), where the number of equivalence classes was evaluated for any string of length 2.In this paper, we evaluate the number of equivalence classes in the set of ballot paths for any string of length 2 and 3, as well as in the set of Dyck paths for any string of length 3.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
