Enumerating the number of admissible stack polygons: An approach using finite automaton
Let R(H, W) be a rectangle with positively integral valued height H and width W. We consider the classes of stack polygons that can be formed inside R(H, W) in such a way that the point of origin and the base of these polygons respectively coincides with the southwest corner and the bottom portion o...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | text |
| 出版: |
Animo Repository
2009
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/faculty_research/7813 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | De La Salle University |
| 總結: | Let R(H, W) be a rectangle with positively integral valued height H and width W. We consider the classes of stack polygons that can be formed inside R(H, W) in such a way that the point of origin and the base of these polygons respectively coincides with the southwest corner and the bottom portion of R(H, W). In this paper, we construct an automaton to enumerate the number of stack polygons that satisfies the above restrictions. Moreover we derive the generating function from this automaton. |
|---|