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