On the enumeration and generation of generalized Dyck words
✍ Scribed by Philippe Duchon
- Book ID
- 108315516
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 141 KB
- Volume
- 225
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract A novel efficient computer‐oriented approach, based on the DAST (dualist angle‐restricted spanning tree) code, is introduced for enumeration and generation of planar polyhex hydrocarbons. It is much faster than other approaches in the literature. The numbers of planar polyhex hydrocarbo
Some properties of the language {w E (a, b}\* 1 d;) = (g)}, which can be regarded as a generalization of the (unrestricted) Dyck-language, are given. (Q are the binomial coefficients for words.)
A computer-oriented method for the enumeration and generation of physical trees is presented. Physical trees depict acyclic chemical structures, but the term physical is used to stress the process by which the structures are produced.