In this paper we consider compositions of n as bargraphs. The depth of a cell inside this graphical representation is the minimum number of horizontal and/or vertical unit steps that are needed to exit to the outside. The depth of the composition is the maximum depth over all cells of the composition. We use finite automata to study the generating function for the number of compositions having a depth of at least r.
Bibliographical notePublisher Copyright:
© 2019, Springer Nature Switzerland AG.
- Generating function
ASJC Scopus subject areas
- Computational Mathematics
- Computational Theory and Mathematics
- Applied Mathematics