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

Authors

Raymond R. Lapus

College

College of Science

Department/Unit

Mathematics and Statistics Department

Document Type

Conference Proceeding

Source Title

Kolloquium über Kombinatorik

Publication Date

11-2009

Abstract

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.

html

Recommended Citation

Lapus, R. R. (2009). Enumerating the number of admissible stack polygons: An approach using finite automaton. Kolloquium über Kombinatorik Retrieved from https://animorepository.dlsu.edu.ph/faculty_research/7813

Disciplines

Mathematics

Note

Abstract only

Keywords

Polygons

Upload File

wf_no