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:
| Main Author: | |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2009
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/7813 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| id |
oai:animorepository.dlsu.edu.ph:faculty_research-8534 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:faculty_research-85342022-11-18T06:32:04Z Enumerating the number of admissible stack polygons: An approach using finite automaton Lapus, Raymond R. 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. 2009-11-01T07:00:00Z text https://animorepository.dlsu.edu.ph/faculty_research/7813 Faculty Research Work Animo Repository Polygons Mathematics |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| topic |
Polygons Mathematics |
| spellingShingle |
Polygons Mathematics Lapus, Raymond R. Enumerating the number of admissible stack polygons: An approach using finite automaton |
| description |
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. |
| format |
text |
| author |
Lapus, Raymond R. |
| author_facet |
Lapus, Raymond R. |
| author_sort |
Lapus, Raymond R. |
| title |
Enumerating the number of admissible stack polygons: An approach using finite automaton |
| title_short |
Enumerating the number of admissible stack polygons: An approach using finite automaton |
| title_full |
Enumerating the number of admissible stack polygons: An approach using finite automaton |
| title_fullStr |
Enumerating the number of admissible stack polygons: An approach using finite automaton |
| title_full_unstemmed |
Enumerating the number of admissible stack polygons: An approach using finite automaton |
| title_sort |
enumerating the number of admissible stack polygons: an approach using finite automaton |
| publisher |
Animo Repository |
| publishDate |
2009 |
| url |
https://animorepository.dlsu.edu.ph/faculty_research/7813 |
| _version_ |
1767196766232379392 |