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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
