| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 970 6 |
| Ultima descărcare din IBN: 2022-01-06 11:37 |
| Căutarea după subiecte similare conform CZU |
| 519.6+519.85 (5) |
| Matematică computațională. Analiză numerică. Programarea calculatoarelor (123) |
| Cercetări operaționale (OR) teorii şi metode matematice (169) |
 SM ISO690:2012BARIL, Jean-Luc, DO, Phan-Thuan. ECO-generation for some restricted classes of
compositions. In: Computer Science Journal of Moldova, 2013, nr. 1(61), pp. 97-119. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 1(61) / 2013 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 519.6+519.85 | ||||||
| Pag. 97-119 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
We study several restricted classes of compositions by giving
one-to-one maps between them and different classes of restricted
binary strings or pattern avoiding permutations. Inspired by the
ECO method [8], new succession rules for these classes are presented. Finally, we obtain generating algorithms in Constant
Amortized Time (CAT) for theses classes. |
||||||
| Cuvinte-cheie Composition of an integer, ECO method, succession rule, generating tree, pattern avoiding permutation. |
||||||
|
|
|
|
