Year-end Sale % OFF 
Abstract
We provide a new algebraic grammar for generalized Dyck languages as introduced by Labelle and Yeh (Discrete Math. 82 (1990) 1–6). The study of these languages leads to the particular sublanguages of words without proper factors belonging to the studied language. A random generation scheme is shown for generalized Dyck languages, which leads to some asymptotic results. In the two-letter case, for which the words correspond to ‘rational slope Dyck paths’, more exact and asymptotic enumerative results are obtained, including the asymptotic average area to integer or 3 2 slope Dyck paths.
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.
