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 |