Abstract
We introduce a family of Eulerian digraphs, E, associated with Dyck words. We provide the algorithms implementing the bijection between E and W, the set of Dyck words. To do so, we exploit a binary matrix, that we call Dyck matrix, representing the cycles of an Eulerian digraph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
