Abstract

This paper sets into relation three different classes of trees: (i) mod r-valent planted plane trees; (ii) r-valent planted plane trees; and (iii) subtrees of a certain infinite planted tree. Practically, all three classes of trees are counted by the same generating function, which is calculated by mapping trees on the words of a language. This leads to producing a one-to-one correspondence between the three classes by means of codes.

Full Text
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

Disclaimer: 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.