Enumerating the number of admissible stack polygons: An approach using finite automaton

• المؤلف الرئيسي: Lapus, Raymond R.
• التنسيق: text
• منشور في: Animo Repository 2009
• الموضوعات: Polygons; Mathematics
• الوصول للمادة أونلاين: 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 o...